Pages that link to "Item:Q1374676"
From MaRDI portal
The following pages link to A proof of strongly uniform termination for Gödel's \(T\) by methods from local predicativity (Q1374676):
Displaying 9 items.
- How to assign ordinal numbers to combinatory terms with polymorphic types (Q453195) (← links)
- Term rewriting theory for the primitive recursive functions (Q674412) (← links)
- Reduction of higher type levels by means of an ordinal analysis of finite terms (Q759749) (← links)
- Continuous normalization for the lambda-calculus and Gödel's T (Q1772771) (← links)
- Ptykes in Gödels T und Definierbarkeit von Ordinalzahlen. (Ptykes in Gödel's T and definability of ordinal numbers) (Q1825868) (← links)
- How is it that infinitary methods can be applied to finitary mathematics? Gödel's <i>T</i>: a case study (Q4254685) (← links)
- Analyzing Gödel's T Via Expanded Head Reduction Trees (Q4521126) (← links)
- A Glimpse of $$ \sum_{3} $$-elementarity (Q5013913) (← links)
- Predicatively unprovable termination of the Ackermannian Goodstein process (Q5113418) (← links)
