A cut-free sequent calculus for the logic of constant domains with a limited amount of duplications
From MaRDI portal
Publication:4934883
DOI10.1093/JIGPAL/7.6.733zbMATH Open0939.03032OpenAlexW2115028558MaRDI QIDQ4934883FDOQ4934883
Pierangelo Miglioli, Camillo Fiorentini
Publication date: 30 January 2000
Published in: Logic Journal of the IGPL (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/6389afb77abfe4cb43c8c659468a378e7f3b2eed
tableau calculuscut-free sequent calculuscontext-ruleduplications of formulaspredicate intermediate logic of constant domains
Cited In (6)
- Nested sequents for intuitionistic logics
- From cut-free calculi to automated deduction: the case of bounded contraction
- A Cut-Free and Invariant-Free Sequent Calculus for PLTL
- Title not available (Why is that?)
- Restricting Initial Sequents: The Trade-Offs Between Identity, Contraction and Cut
- A representation of proper BC domains based on conjunctive sequent calculi
Recommendations
- Title not available (Why is that?) 👍 👎
- 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 👍 👎
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)
