COMPUTABILITY IN UNCOUNTABLE BINARY TREES

DOI10.1017/jsl.2019.5zbMath1498.03095OpenAlexW2921801007MaRDI QIDQ5195058

Reese Johnston

Publication date: 17 September 2019

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

Full work available at URL: https://semanticscholar.org/paper/0d97b5b7ff71910dc5ea9d7df0bcfe2b9b08d7e3

zbMATH Keywords

set theorycomputabilityrecursion theoryadmissible recursion theory

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ordinal machines and admissible recursion theory
• Techniques of admissible recursion theory
• Negative solutions to Post's problem. II
• The Role of True Finiteness in the Admissible Recursively Enumerable Degrees
• Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
• Classes of structures with universe a subset of  1
• Metarecursive sets
• The fine structure of the constructible hierarchy
• ∏ 0 1 Classes and Degrees of Theories