The modal logic of provability: cut-elimination
From MaRDI portal
Publication:790809
DOI10.1007/BF00249262zbMATH Open0535.03031MaRDI QIDQ790809FDOQ790809
Publication date: 1983
Published in: Journal of Philosophical Logic (Search for Journal in Brave)
Cites Work
Cited In (20)
- A proof theory for the logic of provability in true arithmetic
- Sequent calculi for Visser's propositional logics
- A PURELY SYNTACTIC AND CUT-FREE SEQUENT CALCULUS FOR THE MODAL LOGIC OF PROVABILITY
- Circular proofs for the Gödel-Löb provability logic
- Generic Modal Cut Elimination Applied to Conditional Logics
- Title not available (Why is that?)
- Cut elimination for GLS using the terminability of its regress process
- Cut-elimination for weak Grzegorczyk logic Go
- On some proof theoretical properties of the modal logic GL
- Proof analysis in modal logic
- Theoremhood-preserving Maps Characterizing Cut Elimination for Modal Provability Logics
- Cut-elimination for provability logic by terminating proof-search: formalised and deconstructed using Coq
- The modal logic of provability. The sequential approach
- Provability multilattice logic
- Valentini's cut-elimination for provability logic resolved
- On the proof-theory of two formalisations of modal first-order logic
- Sequent calculi for intuitionistic Gödel-Löb logic
- Machine Checking Proof Theory: An Application of Logic to Logic
- The bounded proof property via step algebras and step frames
- Modal tableau calculi and interpolation
This page was built for publication: The modal logic of provability: cut-elimination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q790809)