Nested sequents or tree-hypersequents -- a survey
From MaRDI portal
Cites work
- 2-sequent calculus: A proof theory of modalities
- A contraction-free and cut-free sequent calculus for propositional dynamic logic
- A cut-free simple sequent calculus for modal logic S5
- A deep inference system for the modal logic S5
- A Note on Uniform Interpolation Proofs in Modal Deep Inference Calculi
- A perspective on modal sequent logic
- A purely syntactic and cut-free sequent calculus for the modal logic of provability
- A systematic proof theory for several modal logics
- A unified semantic framework for fully structural propositional sequent systems
- A uniform framework for substructural logics with modalities
- About cut elimination for logics of common knowledge
- An analysis of (linear) exponentials based on extended sequents
- An analytic calculus for the intuitionistic logic of proofs
- Combining monotone and normal modal logic in nested sequents -- with countermodels
- CUT ELIMINATION FOR PROPOSITIONAL DYNAMIC LOGIC WITHOUT
- Cut elimination in nested sequents for intuitionistic modal logics
- Cut-elimination and proof-search for bi-intuitionistic logic using nested sequents
- Cut-free completeness for modular hypersequent calculi for modal logics K, T, and D
- Cut-free modal sequents for normal modal logics
- Cut-free sequent calculi for some tense logics
- Deep sequent systems for modal logic
- Deep sequent systems for modal logic
- Display calculi and other modal calculi: a comparison
- Display logic
- Display to Labeled Proofs and Back Again for Tense Logics
- Displaying modal logic
- Failure of interpolation in constant domain intuitionistic logic
- From single agent to multi-agent via hypersequents
- Gentzen calculi for modal propositional logic
- Gentzen systems for modal logic
- Grafting hypersequents onto nested sequents
- Handbook of philosophical logic. Vol. 8
- How to universally close the existential rule
- scientific article; zbMATH DE number 3125693 (Why is no real title available?)
- scientific article; zbMATH DE number 3131074 (Why is no real title available?)
- scientific article; zbMATH DE number 956466 (Why is no real title available?)
- scientific article; zbMATH DE number 3670430 (Why is no real title available?)
- scientific article; zbMATH DE number 192927 (Why is no real title available?)
- scientific article; zbMATH DE number 1252393 (Why is no real title available?)
- scientific article; zbMATH DE number 1267561 (Why is no real title available?)
- scientific article; zbMATH DE number 1007358 (Why is no real title available?)
- scientific article; zbMATH DE number 2068679 (Why is no real title available?)
- scientific article; zbMATH DE number 1749009 (Why is no real title available?)
- scientific article; zbMATH DE number 6863660 (Why is no real title available?)
- scientific article; zbMATH DE number 949290 (Why is no real title available?)
- scientific article; zbMATH DE number 3212004 (Why is no real title available?)
- scientific article; zbMATH DE number 6302922 (Why is no real title available?)
- scientific article; zbMATH DE number 5263148 (Why is no real title available?)
- scientific article; zbMATH DE number 3260754 (Why is no real title available?)
- scientific article; zbMATH DE number 3274715 (Why is no real title available?)
- scientific article; zbMATH DE number 970628 (Why is no real title available?)
- scientific article; zbMATH DE number 3199779 (Why is no real title available?)
- scientific article; zbMATH DE number 3073037 (Why is no real title available?)
- scientific article; zbMATH DE number 7650841 (Why is no real title available?)
- Hypersequent rules with restricted contexts for propositional modal logics
- Indexed systems of sequents and cut-elimination
- Inducing syntactic cut-elimination for indexed nested sequents
- Label-free modular systems for classical and intuitionistic modal logics
- Label-free natural deduction systems for intuitionistic and classical modal logics
- Labelled tree sequents, tree hypersequents and nested (deep) sequents
- Linear Nested Sequents, 2-Sequents and Hypersequents
- LINEAR TIME IN HYPERSEQUENT FRAMEWORK
- Logic for programming, artificial intelligence, and reasoning. 20th international conference, LPAR-20 2015, Suva, Fiji, November 24--28, 2015. Proceedings
- Logic, language, information and computation. 16th international workshop, WoLLIC 2009, Tokyo, Japan, June 21--24, 2009. Proceedings
- Maehara-style modal nested calculi
- Modal interpolation via nested sequents
- Modal logic
- Modularisation of sequent calculi for normal and non-normal modalities
- MOIN: A Nested Sequent Theorem Prover for Intuitionistic Modal Logics (System Description)
- Multicomponent proof-theoretic method for proving interpolation properties
- Nested sequent calculi for normal conditional logics
- Nested sequents for intuitionistic logics
- Nested sequents for intuitionistic modal logics via structural refinement
- Nested sequents for provability logic GLP: FIG. 1.
- Nested sequents for the logic of conditional belief
- On deriving nested calculi for intuitionistic logics from semantic systems
- On nested sequents for constructive modal logics
- On some calculi of modal logic
- On the Correspondence between Display Postulates and Deep Inference in Nested Sequent Calculi for Tense Logics
- On the correspondence between nested calculi and semantic systems for intuitionistic logics
- On the logic of ability
- On the proof theory of the modal logic for arithmetic provability
- Prefixed tableaus and nested sequents
- Proof analysis in modal logic
- Proof methods for modal and intuitionistic logics
- Proof theory for indexed nested sequents
- Reflecting the semantic features of S5 at the syntactic level
- Sequentialising nested systems
- Single step tableaux for modal logics. Computational properties, complexity and methodology
- Syntactic cut-elimination and backward proof-search for tense logic via linear nested sequents
- Syntactic cut-elimination for common knowledge
- Tableau methods for modal and temporal logics
- Tableau methods of proof for modal logics
- The Amalgamation Property for Varieties of Lattices
- The elimination theorem when modality is present
- The logic of justification
- The Method of Tree-Hypersequents for Modal Propositional Logic
- The modal logic of provability. The sequential approach
- Tree-sequent calculi and decision procedures for intuitionistic modal logics
- Untersuchungen über das logische Schließen. I.
Cited in
(2)
This page was built for publication: Nested sequents or tree-hypersequents -- a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7032190)