Nested recursion

DOI10.1007/BF01342980zbMath0111.01001OpenAlexW4249116257MaRDI QIDQ1131248

William W. Tait

Publication date: 1961

Published in: Mathematische Annalen (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/160860

zbMATH Keywords

mathematical logic

Related Items (22)

Herbrand analyses ⋮ Undecidable complexity statements in -arithmetic ⋮ A classification of the ordinal recursive functions ⋮ Functionals defined by transfinite recursion ⋮ The first example of a recursive function which is not primitive recursive ⋮ The hierarchy of terminating recursive programs over N ⋮ Satisfying Predicates: Kleene's Proof of the Hilbert–Bernays Theorem ⋮ Beweistheoretische Charakterisierung einer Erweiterung der Grzegorczyk-Hierarchie ⋮ Ordinal recursion, and a refinement of the extended Grzegorczyk hierarchy ⋮ Minimal readability of intuitionistic arithmetic and elementary analysis ⋮ On n-quantifier induction ⋮ A NOTE ON PREDICATIVE ORDINAL ANALYSIS I: ITERATED COMPREHENSION AND TRANSFINITE INDUCTION ⋮ Ordinal complexity of recursive definitions ⋮ Exact bounds on epsilon processes ⋮ Pa-Beweisbare ∀∃-Formeln ⋮ Long finite sequences ⋮ UNFOLDING FINITIST ARITHMETIC ⋮ Unfolding Schematic Systems ⋮ Reduction of higher type levels by means of an ordinal analysis of finite terms ⋮ Reducing Ordinal Recursion ⋮ Classifications of Recursive Functions by Means of Hierarchies ⋮ On definition trees of ordinal recursive functionals: Reduction of the recursion orders by means of type level raising

Cites Work

• Beweisbarkeit und Unbeweisbarkeit von Anfangsfällen der transfiniten Induktion in der reinen Zahlentheorie
• On the interpretation of non-finitist proofs–Part II
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Nested recursion