On λ-Definable Functions on Ordinals

DOI10.1007/978-3-642-39053-1_16zbMath1433.03037OpenAlexW197293827MaRDI QIDQ5326365

Benjamin Seyfferth, Tim Fischbach

Publication date: 5 August 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39053-1_16

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Cites Work

• Unnamed Item
• Register computations on ordinals
• The lambda calculus, its syntax and semantics
• Aspects of constructibility
• Turing Computations On Ordinals
• Effective model theory vs. recursive model theory

This page was built for publication: On λ-Definable Functions on Ordinals