Pages that link to "Item:Q4934883"

The following pages link to A cut-free sequent calculus for the logic of constant domains with a limited amount of duplications (Q4934883):

Displaying 8 items.

• From cut-free calculi to automated deduction: the case of bounded contraction (Q1744444) (← links)
• Nested sequents for intuitionistic logics (Q2443118) (← links)
• Restricting Initial Sequents: The Trade-Offs Between Identity, Contraction and Cut (Q3305560) (← links)
• A Cut-Free and Invariant-Free Sequent Calculus for PLTL (Q3608433) (← links)
• Cut‐Elimination Theorem for the Logic of Constant Domains (Q4304102) (← links)
• (Q4636039) (← links)
• Duplication-free tableau calculi and related cut-free sequent calculi for the interpolable propositional intermediate logics (Q4700536) (← links)
• A representation of proper BC domains based on conjunctive sequent calculi (Q5220179) (← links)