Rooted hypersequent calculus for modal logic \textsf{S5}

DOI10.1007/S11787-023-00328-WarXiv1905.09039OpenAlexW2945569854MaRDI QIDQ6054106

Hamzeh Mohammadi, Mojtaba Aghaei

Publication date: 24 October 2023

Published in: Logica Universalis (Search for Journal in Brave)

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

zbMATH Keywords

proof theorycut-eliminationhypersequent calculusmodal logic \textsf{S5}

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Cut-elimination and normal-form theorems (03F05) Proof theory in general (including proof-theoretic semantics) (03F03)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hypersequent rules with restricted contexts for propositional modal logics
• Proof analysis in modal logic
• Deep sequent systems for modal logic
• Gentzen calculi for modal propositional logic
• Proof methods for modal and intuitionistic logics
• Predicate logics on display
• Indexed systems of sequents and cut-elimination
• Display logic
• A deep inference system for the modal logic S5
• Correspondence between Modal Hilbert Axioms and Sequent Rules with an Application to S5
• Hypersequent Calculi for S5: The Methods of Cut Elimination
• A CUT-FREE SIMPLE SEQUENT CALCULUS FOR MODAL LOGIC S5
• A cut-free Gentzen-type system for the modal logic S5
• Sequent Calculi for Normal Modal Propositional Logics
• Cut-free double sequent calculus for S5
• A cut-free Gentzen formulation of the modal logic S5
• Grafting hypersequents onto nested sequents
• From Frame Properties to Hypersequent Rules in Modal Logics

This page was built for publication: Rooted hypersequent calculus for modal logic \textsf{S5}