Reduction of higher type levels by means of an ordinal analysis of finite terms
From MaRDI portal
(Redirected from Publication:759749)
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)
Cites work
- scientific article; zbMATH DE number 3497886 (Why is no real title available?)
- scientific article; zbMATH DE number 3247155 (Why is no real title available?)
- Functionals defined by recursion
- Nested recursion
- On definition trees of ordinal recursive functionals: Reduction of the recursion orders by means of type level raising
- Ordinal analysis of terms of finite type
- Recursion on the countable functionals
- The lambda calculus, its syntax and semantics
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)
