On the recursive functions of ordinal numbers

DOI10.2969/JMSJ/01220119MaRDI QIDQ772783zbMATH OpenOpenAlexFDO

Authors Gaisi Takeuti

Publication date 1960

Published in Journal of the Mathematical Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2969/jmsj/01220119

zbMATH Keywords

philosophy and foundations of mathematics

Cited in

(14)

• Real-valued measurable cardinals and $\sum _1^1 $-transcendency of cardinals
• Transcendence of cardinals
• COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS II: DEGREE SPECTRA
• The Role of True Finiteness in the Admissible Recursively Enumerable Degrees
• Characterisations of variant transfinite computational models: Infinite time Turing, ordinal time Turing, and Blum–Shub–Smale machines
• α-degrees of α-theories
• Minimal α-recursion theoretic degrees
• THE THEORY OF THE METARECURSIVELY ENUMERABLE DEGREES
• On generalized computational complexity
• Computability and uncountable linear orders. I: Computable categoricity.
• ℵ₀-Complete cardinals and transcendency of cardinals
• Nonaxiomatizability results for infinitary systems
• A formalization of the theory of ordinal numbers
• Ordinal machines and admissible recursion theory

This page was built for publication: On the recursive functions of ordinal numbers

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