Pages that link to "Item:Q3887455"
From MaRDI portal
The following pages link to Ordinal analysis of terms of finite type (Q3887455):
Displaying 14 items.
- Continuity of Gödel's system T definable functionals via effectful forcing (Q265800) (← links)
- Primitive recursion and the chain antichain principle (Q435242) (← links)
- How to assign ordinal numbers to combinatory terms with polymorphic types (Q453195) (← links)
- Reduction of higher type levels by means of an ordinal analysis of finite terms (Q759749) (← links)
- Perpetual reductions in \(\lambda\)-calculus (Q1286373) (← links)
- Strong normalization from weak normalization in typed \(\lambda\)-calculi (Q1357009) (← links)
- Combinatory logic with polymorphic types (Q2144609) (← links)
- Representing definable functions of \(\mathrm{HA}^{\omega}\) by neighbourhood functions (Q2417962) (← links)
- An upper bound for reduction sequences in the typed \(\lambda\)-calculus (Q2639840) (← links)
- On the Cantor-Bendixson rank of a set that is searchable in Gödel's \(T\) (Q2799751) (← links)
- Term extraction and Ramsey's theorem for pairs (Q2915896) (← links)
- (Q3887456) (← links)
- Ordinal analysis of simple cases of bar recursion (Q3912574) (← links)
- Upper bounds for standardizations and an application (Q4254636) (← links)
