A cut-free sequent calculus for the logic of constant domains with a limited amount of duplications
From MaRDI portal
Publication:4934883
Recommendations
- scientific article; zbMATH DE number 6863649
- Cut-elimination and a permutation-free sequent calculus for intuitionistic logic
- Cut-free ordinary sequent calculi for logics having generalized finite-valued semantics
- A contraction-free and cut-free sequent calculus for propositional dynamic logic
- Cut‐Elimination Theorem for the Logic of Constant Domains
- Cut-free sequent calculi for logics characterized by finite linear Kripke frames
- A Cut-Free Sequent Calculus for Bi-intuitionistic Logic
- Modular construction of cut-free sequent calculi for paraconsistent logics
- Constructing cut free sequent systems with context restrictions based on classical or intuitionistic logic
- A cut-free sequent calculus for relevant logic RW
Cited in
(7)- Restricting Initial Sequents: The Trade-Offs Between Identity, Contraction and Cut
- A Cut-Free and Invariant-Free Sequent Calculus for PLTL
- Cuts, gluts and gaps
- scientific article; zbMATH DE number 6863649 (Why is no real title available?)
- A representation of proper BC domains based on conjunctive sequent calculi
- Nested sequents for intuitionistic logics
- From cut-free calculi to automated deduction: the case of bounded contraction
This page was built for publication: A cut-free sequent calculus for the logic of constant domains with a limited amount of duplications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4934883)