Pages that link to "Item:Q3371147"
From MaRDI portal
The following pages link to Completeness and Cut-elimination in the Intuitionistic Theory of Types (Q3371147):
Displayed 7 items.
- Reconsidering pairs and functions as sets (Q286796) (← 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)
- Abstract deduction and inferential models for type theory (Q988551) (← links)
- First-order automated reasoning with theories: when deduction modulo theory meets practice (Q2209546) (← links)
- On the Convergence of Reduction-based and Model-based Methods in Proof Theory (Q2866742) (← links)
- A Constructive Semantic Approach to Cut Elimination in Type Theories with Axioms (Q3540178) (← links)