Reduction of higher type levels by means of an ordinal analysis of finite terms
DOI10.1016/0168-0072(85)90031-4zbMATH Open0554.03024OpenAlexW2133262398MaRDI QIDQ759749FDOQ759749
Authors: Jan Terlouw 
Publication date: 1985
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://pure.rug.nl/ws/files/130207356/1_s2.0_0168007285900314_main.pdf
Recommendations
- scientific article; zbMATH DE number 1223615
- A proof of strongly uniform termination for Gödel's \(T\) by methods from local predicativity
- How is it that infinitary methods can be applied to finitary mathematics? Gödel's T: a case study
- Tarskian and Kripkean truth
- Complexity of Gödel’s T in λ-Formulation
- Derivation lengths classification of Gödel's T extending Howard's assignment
- Consistency proof via pointwise induction
- scientific article; zbMATH DE number 1390277
- Techniques of admissible recursion theory
- Ptykes in Gödels T und Definierbarkeit von Ordinalzahlen. (Ptykes in Gödel's T and definability of ordinal numbers)
Cut-elimination and normal-form theorems (03F05) Recursive functions and relations, subrecursive hierarchies (03D20) Higher-type and set recursion theory (03D65)
Cites Work
- Ordinal analysis of terms of finite type
- Recursion on the countable functionals
- The lambda calculus, its syntax and semantics
- On definition trees of ordinal recursive functionals: Reduction of the recursion orders by means of type level raising
- Nested recursion
- Title not available (Why is that?)
- Functionals defined by recursion
- Title not available (Why is that?)
Cited In (4)
This page was built for publication: Reduction of higher type levels by means of an ordinal analysis of finite terms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q759749)
