The modal logic of provability. The sequential approach
From MaRDI portal
Publication:1056745
Cites work
- A modal sequent calculus for a fragment of arithmetic
- An effective fixed-point theorem in intuitionistic diagonalizable algebras. (The algebraization of the theories which express Theor. IX.)
- Extremely undecidable sentences
- scientific article; zbMATH DE number 3652414 (Why is no real title available?)
- scientific article; zbMATH DE number 3708351 (Why is no real title available?)
- scientific article; zbMATH DE number 3628926 (Why is no real title available?)
- scientific article; zbMATH DE number 3635994 (Why is no real title available?)
- scientific article; zbMATH DE number 3009953 (Why is no real title available?)
- Intuitionistic diagonalizable algebras
- On the proof theory of the modal logic for arithmetic provability
- Provability interpretations of modal logic
- Solution of a problem of Leon Henkin
- THE MODAL LOGIC OF CONSISTENCY ASSERTIONS OF PEANO ARITHMETIC
- The modal logic of provability: cut-elimination
- The uniqueness of the fixed-point in every diagonalizable algebra. (The algebraization of the theories which express Theor. VIII.)
Cited in
(41)- Formal topological characterizations of various continuous domains
- Provability: The emergence of a mathematical modality
- Syntactical results on the arithmetical completeness of modal logic
- The fixed point property in modal logic
- Cut-elimination for weak Grzegorczyk logic Go
- Interpolation properties for Sacchetti's logics
- Effectively constructible fixed points in Sacchetti's modal logics of provability
- Cut-elimination for provability logic by terminating proof-search: formalised and deconstructed using Coq
- A proof theory for the logic of provability in true arithmetic
- Circular proofs for the Gödel-Löb provability logic
- Note on some fixed point constructions in provability logic
- Cut elimination for GLS using the terminability of its regress process
- Valentini's cut-elimination for provability logic resolved
- A New Arithmetically Incomplete First-Order Extension of Gl All Theorems of Which Have Cut Free Proofs
- A realization theorem for the Gödel-Löb provability logic
- Kripke Semantics for Basic Sequent Systems
- Intuitionistic Decision Procedures Since Gentzen
- The Henkin sentence
- The Method of Tree-Hypersequents for Modal Propositional Logic
- Provability in finite subtheories of PA and relative interpretability: a modal investigation
- Polynomially and superexponentially shorter proofs in fragments of arithmetic
- A formalization of Sambins's normalization for GL
- 2003 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquim '03
- Modal interpolation via nested sequents
- Dual-context calculi for modal logic
- Provability multilattice logic
- On the proof-theory of two formalisations of modal first-order logic
- Proof-theoretic results of common sense modal predicate calculi
- Simple sequent systems for the modal logics K, D, T, and S4
- Syntactic cut-elimination for provability logic GL via nested sequents
- Nested sequents or tree-hypersequents -- a survey
- Mechanised uniform interpolation for modal logics K, GL, and iSL
- A hypersequent solution to the inferentialist problem of modality
- Unifying sequent systems for Gödel-Löb provability logic via syntactic transformations
- The bounded proof property via step algebras and step frames
- The modal logic of provability: cut-elimination
- Modal tableau calculi and interpolation
- On some proof theoretical properties of the modal logic GL
- Proof analysis in modal logic
- An epistemic logic for becoming informed
- Uniform interpolation and propositional quantifiers in modal logics
This page was built for publication: The modal logic of provability. The sequential approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1056745)
