On the proof theory of the modal logic for arithmetic provability
From MaRDI portal
Publication:3914957
DOI10.2307/2273755zbMATH Open0464.03019OpenAlexW2036161385MaRDI QIDQ3914957FDOQ3914957
Authors: Daniel M. Leivant
Publication date: 1981
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2273755
Cites Work
Cited In (17)
- Circular proofs for the Gödel-Löb provability logic
- Title not available (Why is that?)
- The closed fragment of IL is PSPACE hard
- A purely syntactic and cut-free sequent calculus for the modal logic of provability
- A cut-free sequential system for the propositional modal logic of finite chains
- Proof-theoretic results of common sense modal predicate calculi
- The modal logic of provability: cut-elimination
- On some proof theoretical properties of the modal logic GL
- Proof analysis in modal logic
- 2003 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquim '03
- 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
- Machine Checking Proof Theory: An Application of Logic to Logic
- Modal tableau calculi and interpolation
- A realization theorem for the Gödel-Löb provability logic
This page was built for publication: On the proof theory of the modal logic for arithmetic provability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3914957)