Sequent Calculi for Normal Modal Propositional Logics
From MaRDI portal
Recommendations
- Displaying modal logic
- Predicate logics on display
- Displaying and deciding substructural logics. I: Logics with contraposition
- scientific article; zbMATH DE number 970630
- Gaggles, Gentzen and Galois: how to display your favourite substructural logic
- scientific article; zbMATH DE number 966898
- Disentangling structural connectives or life without display property
- Power and limits of structural display rules
- Linear logic displayed
- scientific article; zbMATH DE number 970628
Cited in
(45)- Predicate logics on display
- Indexed systems of sequents and cut-elimination
- A proof-theoretic investigation of a logic of positions
- On constructing a logic for the notion of complete and immediate formal grounding
- A set-theoretic translation method for polymodal logics
- Local reductions for the modal cube
- Countermodel construction via optimal hypersequent calculi for non-normal modal logics
- Hypersequent and display calculi -- a unified perspective
- Modular sequent calculi for classical modal logics
- From single agent to multi-agent via hypersequents
- Disentangling structural connectives or life without display property
- Full classical S5 in natural deduction with weak normalization
- Logicality, double-line rules, and modalities
- Non-normal modal logics and conditional logics: semantic analysis and proof theory
- Nested sequent calculi for normal conditional logics
- Linear Nested Sequents, 2-Sequents and Hypersequents
- Self-referentiality of Justified Knowledge
- A cut-free simple sequent calculus for modal logic S5
- The Method of Tree-Hypersequents for Modal Propositional Logic
- Why does the proof-theory of hybrid logic work so well?
- scientific article; zbMATH DE number 4070861 (Why is no real title available?)
- scientific article; zbMATH DE number 1140580 (Why is no real title available?)
- Unified correspondence as a proof-theoretic tool
- POSITIVE LOGIC WITH ADJOINT MODALITIES: PROOF THEORY, SEMANTICS, AND REASONING ABOUT INFORMATION
- Displaying the modal logic of consistency
- Sequent Calculi and Interpolation for Non-Normal Modal and Deontic Logics
- Gentzen sequent calculi for some intuitionistic modal logics
- Brodskio kodavimo metodas teiginių logikai;Brodsky’s coding method for propositional logic
- scientific article; zbMATH DE number 970628 (Why is no real title available?)
- A purely syntactic and cut-free sequent calculus for the modal logic of provability
- Rooted hypersequent calculus for modal logic \textsf{S5}
- The nature of entailment: an informational approach
- Cut Elimination for Extended Sequent Calculi
- Labeled Fitch-style natural deduction for basic intuitionistic conditional logic
- Internal and external calculi: ordering the jungle without being lost in translations
- Simple sequent systems for the modal logics K, D, T, and S4
- Gentzen-type sequent calculus for modal logic S5
- Normalisation for negative free logics without and with definite descriptions
- Substructural negations as normal modal operators
- Proof theory and decision procedures for deontic STIT logics
- Bilateral labeled sequent calculi
- Proof-theoretic functional completeness for the hybrid logics of everywhere and elsewhere
- Proof complexity of modal resolution
- Self-referential justifications in epistemic logic
- Display calculi and other modal calculi: a comparison
This page was built for publication: Sequent Calculi for Normal Modal Propositional Logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4291036)
