A cut-free simple sequent calculus for modal logic S5
From MaRDI portal
Publication:3580655
DOI10.1017/S1755020308080040zbMATH Open1204.03024OpenAlexW2164133707MaRDI QIDQ3580655FDOQ3580655
Authors: Francesca Poggiolesi
Publication date: 13 August 2010
Published in: The Review of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s1755020308080040
Recommendations
Modal logic (including the logic of norms) (03B45) Decidability of theories and sets of sentences (03B25)
Cites Work
- Proof analysis in modal logic
- Deep sequent systems for modal logic
- Title not available (Why is that?)
- A cut-free simple sequent calculus for modal logic S5
- Title not available (Why is that?)
- Indexed systems of sequents and cut-elimination
- A perspective on modal sequent logic
- A cut-free Gentzen-type system for the modal logic S5
- Title not available (Why is that?)
- Sequent-systems for modal logic
- Title not available (Why is that?)
- Sequent Calculi for Normal Modal Propositional Logics
- A cut-free Gentzen formulation of the modal logic S5
- Cut-free modal sequents for normal modal logics
Cited In (49)
- Through an inference rule, darkly
- A contraction-free and cut-free sequent calculus for propositional dynamic logic
- Non-labelled sequent calculi of public announcement expansions of \textbf{K45} and \textbf{S5}
- Sequent calculi for the modal \(\mu \)-calculus over S5
- A labelled sequent calculus for half-order modal logic
- Classical Modal Display Logic in the Calculus of Structures and Minimal Cut-free Deep Inference Calculi for S5
- LINEAR TIME IN HYPERSEQUENT FRAMEWORK
- Simple decision procedure for \(\mathbf {S5}\) in standard cut-free sequent calculus
- Truth values and proof theory
- Display calculi and other modal calculi: a comparison
- Sequent calculi for monotonic modal logics
- The Method of Tree-Hypersequents for Modal Propositional Logic
- A Critical Overview of the Most Recent Logics of Grounding
- Hypersequent calculi for S5: the methods of cut elimination
- Linear Nested Sequents, 2-Sequents and Hypersequents
- A simple cut-free system for a paraconsistent logic equivalent to S5
- Tautology elimination, cut elimination, and S5
- Falsification-aware calculi and semantics for normal modal logics including S4 and S5
- Rooted hypersequent calculus for modal logic \textsf{S5}
- Title not available (Why is that?)
- Cut elimination theorem for non-commutative hypersequent calculus
- On a multilattice analogue of a hypersequent S5 calculus
- Varieties of Relevant S5
- A deep inference system for the modal logic S5
- Valentini's cut-elimination for provability logic resolved
- Hypersequent and display calculi -- a unified perspective
- Title not available (Why is that?)
- Contraction-free calculi for modal logics S5 and KD45
- Natural deduction calculi for classical and intuitionistic S5
- Cut free sequent calculus for logic S5\(_n\)(ED)
- Revisiting epistemic logic with names
- Hypersequent rules with restricted contexts for propositional modal logics
- From single agent to multi-agent via hypersequents
- Cut elimination for \(\mathrm{S4}_n\) and \(\mathrm{K4}_n\) with the central agent axiom
- Eliminability of cut in hypersequent calculi for some modal logics of linear frames
- A cut-free Gentzen formulation of the modal logic S5
- Cut-free sequent calculi for products and relativised products of modal logics
- Two is enough -- bisequent calculus for S5
- Title not available (Why is that?)
- Labeled sequent calculi for modal logics and implicit contractions
- CoNP complexity for combinations of non-normal modal logics
- Conservativeness and eliminability for anti-realistic definitions. Towards a global view of the meaning of logical constants
- An Analytic Propositional Proof System on Graphs
- Non-classical elegance for sequent calculus enthusiasts
- Cut-free completeness for modular hypersequent calculi for modal logics K, T, and D
- A cut-free simple sequent calculus for modal logic S5
- Title not available (Why is that?)
- Correspondence between modal Hilbert axioms and sequent rules with an application to S5
- THE LOGIC OF HYPERLOGIC. PART A: FOUNDATIONS
This page was built for publication: A cut-free simple sequent calculus for modal logic S5
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3580655)