A cut-free sequent calculus for the logic of constant domains with a limited amount of duplications

DOI10.1093/JIGPAL/7.6.733MaRDI QIDQ4934883zbMATH OpenOpenAlexFDO

Authors Camillo Fiorentini, Pierangelo Miglioli

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

zbMATH Keywords

context-rulecut-free sequent calculusduplications of formulaspredicate intermediate logic of constant domainstableau calculus

Mathematics Subject Classification ID

Intermediate logics (03B55) Cut-elimination and normal-form theorems (03F05)

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

(10)

• From cut-free calculi to automated deduction: the case of bounded contraction
• Nested sequents for intuitionistic logics
• Restricting Initial Sequents: The Trade-Offs Between Identity, Contraction and Cut
• On natural deduction for Herbrand constructive logics. III: The strange case of the intuitionistic logic of constant domains
• A Cut-Free and Invariant-Free Sequent Calculus for PLTL
• Cut‐Elimination Theorem for the Logic of Constant Domains
• scientific article; zbMATH DE number 6863649 (Why is no real title available?)
• Duplication-free tableau calculi and related cut-free sequent calculi for the interpolable propositional intermediate logics
• Cuts, gluts and gaps
• A representation of proper BC domains based on conjunctive sequent calculi

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)