On the proof-theory of two formalisations of modal first-order logic

DOI10.1007/S11225-010-9294-YzbMath1218.03022OpenAlexW2095441824MaRDI 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

zbMATH Keywords

sequent calculusreflection theoremcut-eliminationmodal first-order logicmodal interpretation of provability

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Cut-elimination and normal-form theorems (03F05) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)

Related Items (2)

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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: On the proof-theory of two formalisations of modal first-order logic