On the proofs of arithmetical completeness for interpretability logic
From MaRDI portal
(Redirected from Publication:689212)
Recommendations
Cited in
(19)- Interpretability in PRA
- A note on the interpretability logic of finitely axiomatized theories
- A simple proof of arithmetical completeness for \(\Pi_ 1\)-conservativity logic
- On strictly arithmetical completeness in logics of programs
- Interpretability suprema in Peano arithmetic
- Interpretability degrees of finitely axiomatized sequential theories
- A simplified proof of arithmetical completeness theorem for provability logic GLP
- Undecidability in diagonalizable algebras
- scientific article; zbMATH DE number 6863635 (Why is no real title available?)
- Interpretability over peano arithmetic
- TWO NEW SERIES OF PRINCIPLES IN THE INTERPRETABILITY LOGIC OF ALL REASONABLE ARITHMETICAL THEORIES
- Interpretability logics and generalised Veltman semantics
- Characterizations of interpretability in bounded arithmetic
- Classical and Intuitionistic Arithmetic with Higher Order Comprehension Coincide on Inductive Well-Foundedness
- Modal completeness of sublogics of the interpretability logic IL
- Theory and application of labelling techniques for interpretability logics
- An overview of Verbrugge semantics, a.k.a. generalised Veltman semantics
- Modular sequent calculi for interpretability logics
- On the interpretability of arithmetic in temporal logic
This page was built for publication: On the proofs of arithmetical completeness for interpretability logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q689212)
