A purely syntactic and cut-free sequent calculus for the modal logic of provability

DOI10.1017/S1755020309990244MaRDI QIDQ5850981zbMATH OpenFDO

Authors Francesca Poggiolesi

Publication date 21 January 2010

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

Full work available at URL https://doi.org/10.1017/S1755020309990244

zbMATH Keywords

contraction-free sequent calculuscut eliminationGLmodal logic of provabilitytree-hypersequent

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)

Recommendations

• A proof theory for the logic of provability in true arithmetic
• Proof analysis in modal logic
• The modal logic of provability: cut-elimination
• Gentzen calculi for modal propositional logic
• The Method of Tree-Hypersequents for Modal Propositional Logic

Cites work

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

Cited in

(25)

• Proofs and countermodels in non-classical logics
• A cut-free sequent calculus for defeasible erotetic inferences
• Circular proofs for the Gödel-Löb provability logic
• Inducing syntactic cut-elimination for indexed nested sequents
• Valentini's cut-elimination for provability logic resolved
• Valentini's cut-elimination for provability logic resolved
• How to optimize proof-search in modal logics
• The Method of Tree-Hypersequents for Modal Propositional Logic
• A Syntactic Proof of Cut‐Elimination For GL_lin
• scientific article; zbMATH DE number 2024634 (Why is no real title available?)
• Inducing syntactic cut-elimination for indexed nested sequents
• Theoremhood-preserving Maps Characterizing Cut Elimination for Modal Provability Logics
• Generic methods for formalising sequent calculi applied to provability logic
• scientific article; zbMATH DE number 7561320 (Why is no real title available?)
• scientific article; zbMATH DE number 7297836 (Why is no real title available?)
• scientific article; zbMATH DE number 5263148 (Why is no real title available?)
• Provability multilattice logic
• Nested sequents for intermediate logics: the case of Gödel-Dummett logics
• Intuitionistic Gödel-Löb logic, à la Simpson: labelled systems and birelational semantics
• Syntactic cut-elimination for provability logic GL via nested sequents
• Nested sequents or tree-hypersequents -- a survey
• Beyond semantic pollution: towards a practice-based philosophical analysis of labelled calculi
• Unifying sequent systems for Gödel-Löb provability logic via syntactic transformations
• The modal logic of provability: cut-elimination
• Gentzen calculi for modal propositional logic

This page was built for publication: A purely syntactic and cut-free sequent calculus for the modal logic of provability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5850981)