A PURELY SYNTACTIC AND CUT-FREE SEQUENT CALCULUS FOR THE MODAL LOGIC OF PROVABILITY

DOI10.1017/S1755020309990244zbMath1189.03071MaRDI QIDQ5850981

Francesca Poggiolesi

Publication date: 21 January 2010

Published in: The Review of Symbolic Logic (Search for Journal in Brave)

zbMATH Keywords

cut eliminationGLmodal logic of provabilitytree-hypersequentcontraction-free sequent calculus

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

VALENTINI’S CUT-ELIMINATION FOR PROVABILITY LOGIC RESOLVED ⋮ Provability multilattice logic ⋮ Nested sequents for intermediate logics: the case of Gödel-Dummett logics ⋮ Proofs and countermodels in non-classical logics ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Inducing Syntactic Cut-Elimination for Indexed Nested Sequents ⋮ Circular proofs for the Gödel-Löb provability logic

Cites Work

• The modal logic of provability: cut-elimination
• Proof analysis in modal logic
• Cut-free sequent calculi for some tense logics
• The Method of Tree-Hypersequents for Modal Propositional Logic
• On the proof theory of the modal logic for arithmetic provability
• Sequent Calculi for Normal Modal Propositional Logics

This page was built for publication: A PURELY SYNTACTIC AND CUT-FREE SEQUENT CALCULUS FOR THE MODAL LOGIC OF PROVABILITY