The Method of Tree-Hypersequents for Modal Propositional Logic
From MaRDI portal
The Method of Tree-Hypersequents for Modal Propositional Logic
Recommendations
Cites work
- A cut-free simple sequent calculus for modal logic S5
- Cut-free sequent calculi for some tense logics
- Deep sequent systems for modal logic
- Gentzen systems for modal logic
- scientific article; zbMATH DE number 3145226 (Why is no real title available?)
- scientific article; zbMATH DE number 1252393 (Why is no real title available?)
- Indexed systems of sequents and cut-elimination
- Proof analysis in modal logic
- Sequent Calculi for Normal Modal Propositional Logics
- The modal logic of provability. The sequential approach
Cited in
(55)- Modal trees: Correction to a decision procedure for S5 (and T)
- Cut-free modal sequents for normal modal logics
- Maehara-style modal nested calculi
- On graphs for intuitionistic modal logics
- VDM specification for the tree-modification method of refutation
- Uniform interpolation via nested sequents
- A pure view of ecumenical modalities
- A fresh view of linear logic as a logical framework
- Disentangling structural connectives or life without display property
- Nested sequents for intuitionistic logics
- Higher-level inferences in the strong-Kleene setting: a proof-theoretic approach
- Focused and Synthetic Nested Sequents
- Label-free natural deduction systems for intuitionistic and classical modal logics
- On height and happiness
- Natural deduction calculi and sequent calculi for counterfactual logics
- Linear Nested Sequents, 2-Sequents and Hypersequents
- Labeled sequent calculi for modal logics and implicit contractions
- scientific article; zbMATH DE number 956466 (Why is no real title available?)
- NP trees and Carnap's modal logic
- A cut-free sequent system for two-dimensional modal logic, and why it matters
- Tree-sequent calculi and decision procedures for intuitionistic modal logics
- Modal Tree‐Sequents
- MOIN: A Nested Sequent Theorem Prover for Intuitionistic Modal Logics (System Description)
- scientific article; zbMATH DE number 7561320 (Why is no real title available?)
- scientific article; zbMATH DE number 7577569 (Why is no real title available?)
- Cut-free hypersequent calculus for S4.3.
- A purely syntactic and cut-free sequent calculus for the modal logic of provability
- A linear logic framework for multimodal logics
- Provability multilattice logic
- Mechanising Gödel-Löb provability logic in HOL light
- An ecumenical notion of entailment
- Nested sequents for intermediate logics: the case of Gödel-Dummett logics
- Natural deduction calculi for classical and intuitionistic S5
- Justification logic for intuitionistic modal logic
- Refined tableau systems for some modal logics of confluence
- Internal and external calculi: ordering the jungle without being lost in translations
- Simple sequent systems for the modal logics K, D, T, and S4
- Separability and harmony in ecumenical systems
- Uniform interpolation via nested sequents and hypersequents
- Syntactic cut-elimination for provability logic GL via nested sequents
- Nested-sequent calculus for modal logic \textbf{MB}
- Nested sequent calculi for some modal logics with non-standard modalities
- Nested sequents or tree-hypersequents -- a survey
- Proof theory and decision procedures for deontic STIT logics
- Syntactic cut-elimination for a fragment of the modal mu-calculus
- A hypersequent solution to the inferentialist problem of modality
- Beyond semantic pollution: towards a practice-based philosophical analysis of labelled calculi
- Metainferences, invalidities and contraction-free sequent calculi for S5 and Carnap's C
- Unifying sequent systems for Gödel-Löb provability logic via syntactic transformations
- Agent interpolation in distributed systems
- A formal characterization of semantic pollution of modal proof systems
- Deep sequent systems for modal logic
- A contraction-free and cut-free sequent calculus for propositional dynamic logic
- Display calculi and other modal calculi: a comparison
- Gentzen calculi for modal propositional logic
This page was built for publication: The Method of Tree-Hypersequents for Modal Propositional Logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3600562)
