Nested sequents for intuitionistic logics
From MaRDI portal
Publication:2443118
DOI10.1215/00294527-2377869zbMath1327.03006OpenAlexW2087640560MaRDI QIDQ2443118
Publication date: 4 April 2014
Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.ndjfl/1390246437
Other nonclassical logic (03B60) Mechanization of proofs and logical operations (03B35) Temporal logic (03B44) Subsystems of classical logic (including intuitionistic logic) (03B20)
Related Items (14)
Interpolation Method for Multicomponent Sequent Calculi ⋮ Linear Nested Sequents, 2-Sequents and Hypersequents ⋮ Realization Theorems for Justification Logics: Full Modularity ⋮ A pure view of ecumenical modalities ⋮ An ecumenical notion of entailment ⋮ Linear depth deduction with subformula property for intuitionistic epistemic logic ⋮ Nested sequents for intermediate logics: the case of Gödel-Dummett logics ⋮ Proof theory for functional modal logic ⋮ Unnamed Item ⋮ On Height and Happiness ⋮ Modal interpolation via nested sequents ⋮ Through an Inference Rule, Darkly ⋮ Unnamed Item ⋮ Inducing Syntactic Cut-Elimination for Indexed Nested Sequents
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Prefixed tableaus and nested sequents
- Deep sequent systems for modal logic
- Proof methods for modal and intuitionistic logics
- Cut-free sequent calculi for some tense logics
- Tableau methods of proof for modal logics
- Failure of Interpolation in Constant Domain Intuitionistic Logic
- The Method of Tree-Hypersequents for Modal Propositional Logic
- Deep Inference in Bi-intuitionistic Logic
- Cut‐Elimination Theorem for the Logic of Constant Domains
- A logic stronger than intuitionism
- Basic logic: reflection, symmetry, visibility
- A cut-free sequent calculus for the logic of constant domains with a limited amount of duplications
- Sequent-systems for modal logic
This page was built for publication: Nested sequents for intuitionistic logics
