The persistence principle over weak interpretability logic
From MaRDI portal
Publication:6561649
Cites work
- scientific article; zbMATH DE number 51348 (Why is no real title available?)
- scientific article; zbMATH DE number 1735871 (Why is no real title available?)
- scientific article; zbMATH DE number 1170091 (Why is no real title available?)
- scientific article; zbMATH DE number 3199779 (Why is no real title available?)
- A cut-free sequent system for the smallest interpretability logic
- An effective fixed-point theorem in intuitionistic diagonalizable algebras. (The algebraization of the theories which express Theor. IX.)
- Arithmetical completeness theorem for modal logic \(\mathsf{K}\)
- Arithmetical soundness and completeness for \(\Sigma_{2}\) numerations
- Arithmetization of metamathematics in a general setting
- Countably many sublogics of the interpretability logicILhaving fixed point properties
- Explicit fixed points in interpretability logic
- Independent numerations of theories and recursive progressions
- Modal completeness of sublogics of the interpretability logic IL
- ON THE CLASSIFICATION OF PROPOSITIONAL PROVABILITY LOGICS
- On some proof theoretical properties of the modal logic GL
- The absorption law. Or: how to Kreisel a Hilbert-Bernays-Löb
This page was built for publication: The persistence principle over weak interpretability logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6561649)
