On the proof-theory of two formalisations of modal first-order logic
From MaRDI portal
Publication:622627
DOI10.1007/s11225-010-9294-yzbMath1218.03022MaRDI QIDQ622627
George Tourlakis, Yehuda Schwartz
Publication date: 3 February 2011
Published in: Studia Logica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11225-010-9294-y
sequent calculus; reflection theorem; cut-elimination; modal first-order logic; modal interpretation of provability
03B45: Modal logic (including the logic of norms)
03F05: Cut-elimination and normal-form theorems
03F45: Provability logics and related algebras (e.g., diagonalizable algebras)
Related Items
An Arithmetically Complete Predicate Modal Logic, A New Arithmetically Incomplete First-Order Extension of Gl All Theorems of Which Have Cut Free Proofs
Cites Work
- The modal logic of provability: cut-elimination
- The modal logic of provability. The sequential approach
- A modal sequent calculus for a fragment of arithmetic
- A Modal Extension of Weak Generalisation Predicate Logic
- On modal systems having arithmetical interpretations
- On the proof theory of the modal logic for arithmetic provability
- Proof theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item