Sequent Calculi for Normal Modal Propositional Logics
From MaRDI portal
Publication:4291036
DOI10.1093/logcom/4.2.125zbMath0799.03014OpenAlexW2074551833MaRDI QIDQ4291036
Publication date: 24 November 1994
Published in: Journal of Logic and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/logcom/4.2.125
Related Items
Brodskio kodavimo metodas teiginių logikai;Brodsky’s coding method for propositional logic, Proof complexity of modal resolution, Logicality, double-line rules, and modalities, Linear Nested Sequents, 2-Sequents and Hypersequents, A set-theoretic translation method for polymodal logics, From single agent to multi-agent via hypersequents, Indexed systems of sequents and cut-elimination, Rooted hypersequent calculus for modal logic \textsf{S5}, Disentangling structural connectives or life without display property, Self-referentiality of Justified Knowledge, The nature of entailment: an informational approach, Cut Elimination for Extended Sequent Calculi, A proof-theoretic investigation of a logic of positions, On constructing a logic for the notion of complete and immediate formal grounding, Full classical S5 in natural deduction with weak normalization, A CUT-FREE SIMPLE SEQUENT CALCULUS FOR MODAL LOGIC S5, Hypersequent and display calculi -- a unified perspective, POSITIVE LOGIC WITH ADJOINT MODALITIES: PROOF THEORY, SEMANTICS, AND REASONING ABOUT INFORMATION, Self-referential justifications in epistemic logic, Display calculi and other modal calculi: a comparison, The Method of Tree-Hypersequents for Modal Propositional Logic, Displaying the modal logic of consistency, Why does the proof-theory of hybrid logic work so well?, A PURELY SYNTACTIC AND CUT-FREE SEQUENT CALCULUS FOR THE MODAL LOGIC OF PROVABILITY, Local reductions for the modal cube, Proof-theoretic functional completeness for the hybrid logics of everywhere and elsewhere
