CUT-FREE COMPLETENESS FOR MODULAR HYPERSEQUENT CALCULI FOR MODAL LOGICS K, T, AND D

DOI10.1017/S1755020320000180zbMath1486.03040arXiv1805.09437MaRDI QIDQ5027667

Samara Burns, Richard Zach

Publication date: 7 February 2022

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

Full work available at URL: https://arxiv.org/abs/1805.09437

zbMATH Keywords

modal logic; completeness; cut elimination; sequent calculus; hypersequents; linear nested sequents

Mathematics Subject Classification ID

03B45: Modal logic (including the logic of norms)

03F05: Cut-elimination and normal-form theorems

Related Items

Cut Elimination for Extended Sequent Calculi

Cites Work

• Deep sequent systems for modal logic
• Gentzen calculi for modal propositional logic
• Truth values and proof theory
• 2-sequent calculus: A proof theory of modalities
• Syntactic cut-elimination and backward proof-search for tense logic via linear nested sequents
• On some calculi of modal logic
• Linear Nested Sequents, 2-Sequents and Hypersequents
• A CUT-FREE SIMPLE SEQUENT CALCULUS FOR MODAL LOGIC S5
• A cut-free Gentzen formulation of the modal logic S5
• Cut Elimination Theorem for Non-Commutative Hypersequent Calculus
• Modularisation of Sequent Calculi for Normal and Non-normal Modalities
• CUT ELIMINATION IN HYPERSEQUENT CALCULUS FOR SOME LOGICS OF LINEAR TIME
• From Frame Properties to Hypersequent Rules in Modal Logics
• LINEAR TIME IN HYPERSEQUENT FRAMEWORK
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item