On definition trees of ordinal recursive functionals: Reduction of the recursion orders by means of type level raising

DOI10.2307/2273149MaRDI QIDQ3949042zbMATH OpenOpenAlexFDO

Authors Jan Terlouw

Publication date 1982

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2273149

zbMATH Keywords

definability of functionalsfunctional of type level nfunctionals of finite typesnumber-theoretic functions definable by nested recursionscheme of degree nwell-ordering of the set of natural numbers

Mathematics Subject Classification ID

Recursive ordinals and ordinal notations (03F15) Functionals in proof theory (03F10)

Cites work

• Beweisbarkeit und Unbeweisbarkeit von Anfangsfällen der transfiniten Induktion in der reinen Zahlentheorie
• Eine Klassifikation der ε₀‐Rekursiven Funktionen
• Nested recursion
• On n-quantifier induction
• Ordinal recursion, and a refinement of the extended Grzegorczyk hierarchy

Cited in

(4)

• Characterizing complexity classes by higher type primitive recursive definitions
• Reduction of higher type levels by means of an ordinal analysis of finite terms
• How to assign ordinal numbers to combinatory terms with polymorphic types
• Constructing recursion operators in intuitionistic type theory

This page was built for publication: On definition trees of ordinal recursive functionals: Reduction of the recursion orders by means of type level raising

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3949042)