Pages that link to "Item:Q3489979"
From MaRDI portal
The following pages link to Principal type-schemes and condensed detachment (Q3489979):
Displaying 16 items.
- Most general first order theorems are not recursively enumerable (Q672461) (← links)
- Principal type schemes for an extended type theory (Q790801) (← links)
- Double-negation elimination in some propositional logics (Q813082) (← links)
- Condensed detachment is complete for relevance logic: A computer-aided proof (Q1181717) (← links)
- Implementing the `Fool's model' of combinatory logic (Q1181718) (← links)
- The converse principal type-scheme theorem in lambda calculus (Q1194107) (← links)
- Principal types of BCK-lambda-terms (Q1208417) (← links)
- A simplified form of condensed detachment (Q1903086) (← links)
- A finitely axiomatized formalization of predicate calculus with equality (Q1906674) (← links)
- Learning from Łukasiewicz and Meredith: investigations into proof structures (Q2055843) (← links)
- Typing in reflective combinatory logic (Q2498910) (← links)
- Note on deduction theorems in contraction-free logics (Q2888635) (← links)
- The completeness of Heyting first-order logic (Q3160566) (← links)
- Principal type-schemes of BCI-lambda-terms (Q5096242) (← links)
- Lemmas: generation, selection, application (Q6541149) (← links)
- Investigations into proof structures (Q6653096) (← links)