Pages that link to "Item:Q3371147"

The following pages link to Completeness and Cut-elimination in the Intuitionistic Theory of Types (Q3371147):

Displaying 19 items.

• Reconsidering pairs and functions as sets (Q286796) (← links)
• Completeness in hybrid type theory (Q484101) (← links)
• Kripke semantics for higher-order type theory applied to constraint logic programming languages (Q683712) (← links)
• A simple proof that super-consistency implies cut elimination (Q691121) (← links)
• The role of compactification theory in the type problem (Q934308) (← links)
• Abstract deduction and inferential models for type theory (Q988551) (← links)
• An intuitionistic theory of types with assumptions of high-arity variables (Q1192333) (← links)
• First-order automated reasoning with theories: when deduction modulo theory meets practice (Q2209546) (← links)
• An intensional type theory: Motivation and cut-elimination (Q2732287) (← links)
• On the convergence of reduction-based and model-based methods in proof theory (Q2866742) (← links)
• (Q3086771) (← links)
• (Q3322096) (← links)
• A Constructive Semantic Approach to Cut Elimination in Type Theories with Axioms (Q3540178) (← links)
• Completeness and Cut-elimination in the Intuitionistic Theory of Types--Part 2 (Q3553922) (← links)
• The logic of first order intuitionistic type theory with weak sigma-elimination (Q3984424) (← links)
• (Q4206095) (← links)
• Cut-elimination for simple type theory with an axiom of choice (Q4262565) (← links)
• The Role of Completeness in the Type Problem for Infinitely Sheeted Planes (Q4820443) (← links)
• Cut Elimination in a Class of Sequent Calculi for Pure Type Systems (Q4924532) (← links)