Pages that link to "Item:Q1304543"

The following pages link to A cut-elimination proof in intuitionistic predicate logic (Q1304543):

Displaying 23 items.

• On the elimination of quantifier-free cuts (Q650922) (← links)
• A connection between cut elimination and normalization (Q818516) (← links)
• Cut-elimination and interpolation for \(\Omega\)-logic (Q1114684) (← links)
• Some results on cut-elimination, provable well-orderings, induction and reflection (Q1295413) (← links)
• Two measures for proving Gentzen's Hauptsatz without mix (Q1407599) (← links)
• Cut-elimination for a logic with definitions and induction (Q1575931) (← 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)
• A note on cut-elimination for classical propositional logic (Q2144620) (← links)
• \(LE^{t}_{ \to }, LR^{ \circ }_{\widehat{\sim}}, LK\) and cutfree proofs (Q2454875) (← links)
• Computing interpolants in implicational logics (Q2503400) (← links)
• Fixed-Point Elimination in the Intuitionistic Propositional Calculus (Q2811336) (← links)
• Predicate Elimination for Preprocessing in First-Order Theorem Proving (Q2818027) (← links)
• (Q2958526) (← links)
• Cut-Elimination in the Intuitionistic Many-Valued Logic Based on a Partial Order (Q3792660) (← links)
• CUT ELIMINATION FOR PROPOSITIONAL DYNAMIC LOGIC WITHOUT (Q4295221) (← links)
• Theoremhood-preserving Maps Characterizing Cut Elimination for Modal Provability Logics (Q4779590) (← links)
• (Q4840168) (← links)
• A Semantic Proof that Reducibility Candidates entail Cut Elimination (Q5111901) (← links)
• Typed Lambda Calculi and Applications (Q5704011) (← links)
• A proof of Gentzen's \textit{Hauptsatz} without multicut (Q5928308) (← links)
• The elimination of maximum cuts in linear logic and BCK logic (Q6161950) (← links)