Pages that link to "Item:Q1204120"

The following pages link to Bounds for cut elimination in intuitionistic propositional logic (Q1204120):

Displaying 30 items.

• On the elimination of quantifier-free cuts (Q650922) (← links)
• A lower bound for intuitionistic logic (Q876385) (← links)
• Cut-elimination and interpolation for \(\Omega\)-logic (Q1114684) (← links)
• Some results on cut-elimination, provable well-orderings, induction and reflection (Q1295413) (← links)
• Infinitary calculus for a restricted first-order linear temporal logic without contraction on quantified formulas (Q1589838) (← links)
• About cut elimination for logics of common knowledge (Q1772772) (← links)
• Structural cut elimination. I: Intuitionistic and classical logic (Q1854335) (← links)
• Lemma and cut strategies for propositional model elimination (Q1978019) (← links)
• The G4i analogue of a G3i sequent calculus (Q2106879) (← links)
• A note on cut-elimination for classical propositional logic (Q2144620) (← links)
• Uniform interpolation and the existence of sequent calculi (Q2326416) (← links)
• Cut elimination for the unified logic (Q2367410) (← links)
• Sufficient conditions for cut elimination with complexity analysis (Q2461191) (← links)
• Invertible infinitary calculus without loop rules for restricted FTL (Q2577594) (← links)
• Admissibility of structural rules for contraction-free systems of intuitionistic logic (Q2710593) (← links)
• Fixed-Point Elimination in the Intuitionistic Propositional Calculus (Q2811336) (← links)
• Cut-elimination for knowledge logics with interaction (Q2811590) (← links)
• Simulating non-prenex cuts in quantified propositional calculus (Q3096088) (← links)
• Intuitionistic Decision Procedures Since Gentzen (Q3305556) (← links)
• A tableau calculus for Propositional Intuitionistic Logic with a refined treatment of nested implications (Q3647294) (← links)
• A Note on Gentzen's Decision Procedure for Intuitionistic Propositional Logic (Q3752367) (← links)
• Cut-Elimination in the Intuitionistic Many-Valued Logic Based on a Partial Order (Q3792660) (← links)
• 1998 European Summer Meeting of the Association for Symbolic Logic (Q4254644) (← links)
• CUT ELIMINATION FOR PROPOSITIONAL DYNAMIC LOGIC WITHOUT (Q4295221) (← links)
• (Q4840168) (← links)
• An intuitionistic formula hierarchy based on high‐school identities (Q5108846) (← links)
• Elementary elimination of prenex cuts in disjunction-free intuitionistic logic (Q5351952) (← links)
• Effective longest and infinite reduction paths in untyped λ-calculi (Q5878916) (← links)
• A proof of Gentzen's \textit{Hauptsatz} without multicut (Q5928308) (← links)
• Proof theory for Lax Logic (Q6612814) (← links)