Pages that link to "Item:Q5704011"

The following pages link to Typed Lambda Calculi and Applications (Q5704011):

Displaying 35 items.

• Quick cut-elimination for strictly positive cuts (Q639680) (← links)
• Towards a semantic characterization of cut-elimination (Q817704) (← links)
• Resolution is cut-free (Q972424) (← links)
• Lattice-valued representation of the cut-elimination theorem (Q1192582) (← links)
• Bounds for cut elimination in intuitionistic propositional logic (Q1204120) (← links)
• A cut-elimination proof in intuitionistic predicate logic (Q1304543) (← links)
• Indexed systems of sequents and cut-elimination (Q1372944) (← links)
• Cut-elimination and a permutation-free sequent calculus for intuitionistic logic (Q1577341) (← links)
• Structural cut elimination. I: Intuitionistic and classical logic (Q1854335) (← links)
• Some general results about proof normalization (Q1931341) (← links)
• On Artemov and Protopopescu's intuitionistic epistemic logic expanded with distributed knowledge (Q2148837) (← links)
• First-order automated reasoning with theories: when deduction modulo theory meets practice (Q2209546) (← links)
• Regaining cut admissibility in deduction modulo using abstract completion (Q2266989) (← links)
• A cut-free sequent calculus for defeasible erotetic inferences (Q2278843) (← links)
• Towards a clausal analysis of cut-elimination (Q2457341) (← links)
• The role of quantifier alternations in cut elimination (Q2565988) (← links)
• Fixed-Point Elimination in the Intuitionistic Propositional Calculus (Q2811336) (← links)
• On the convergence of reduction-based and model-based methods in proof theory (Q2866742) (← links)
• (Q2958526) (← links)
• Restricting Initial Sequents: The Trade-Offs Between Identity, Contraction and Cut (Q3305560) (← links)
• Completeness and Cut-elimination in the Intuitionistic Theory of Types (Q3371147) (← links)
• Completeness and Cut-elimination in the Intuitionistic Theory of Types--Part 2 (Q3553922) (← links)
• Axiom Directed Focusing (Q3638252) (← links)
• Forcing-Based Cut-Elimination for Gentzen-Style Intuitionistic Sequent Calculus (Q3638285) (← links)
• Automating Theories in Intuitionistic Logic (Q3655199) (← links)
• Cut Elimination in a Class of Sequent Calculi for Pure Type Systems (Q4924532) (← links)
• Lambda terms for natural deduction, sequent calculus and cut elimination (Q4948037) (← links)
• PRESERVATION OF STRUCTURAL PROPERTIES IN INTUITIONISTIC EXTENSIONS OF AN INFERENCE RELATION (Q4961867) (← links)
• Free Definite Description Theory – Sequent Calculi and Cut Elimination (Q5006839) (← links)
• A Semantic Proof that Reducibility Candidates entail Cut Elimination (Q5111901) (← links)
• (Q5202986) (← links)
• (Q5283968) (← links)
• Cut elimination for a calculus with context-dependent rules (Q5945008) (← links)
• A first-order expansion of Artemov and Protopopescu's intuitionistic epistemic logic (Q6115851) (← links)
• Combining first-order classical and intuitionistic logic (Q6659896) (← links)