Local computability for ordinals

DOI10.1007/978-3-642-39053-1_19zbMATH Open1433.03118OpenAlexW102359149MaRDI QIDQ5326366FDOQ5326366

Authors Johanna N. Y. Franklin, Asher M. Kach, Russell Miller, Reed Solomon 

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_19

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Ordinal and cardinal numbers (03E10)

Recommendations

• Ordinal computations
• Locally Computable Structures
• Sums of computable ordinals
• Turing Computations On Ordinals
• Computability on the countable ordinals and the Hausdorff-Kuratowski theorem (extended abstract)

Cited in

(5)

• Computability in uncountable binary trees
• Perfect Local Computability and Computable Simulations
• Locally Computable Structures
• Sums of computable ordinals
• Computability on the countable ordinals and the Hausdorff-Kuratowski theorem (extended abstract)

This page was built for publication: Local computability for ordinals

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