Computability in uncountable binary trees

DOI10.1017/JSL.2019.5MaRDI QIDQ5195058zbMATH OpenOpenAlexFDO

Authors Reese Johnston

Publication date 17 September 2019

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

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

zbMATH Keywords

admissible recursion theorycomputabilityrecursion theoryset theory

Mathematics Subject Classification ID

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

Recommendations

• The computable dimension of trees of infinite height
• Local computability for ordinals
• The Computable Dimension of I-Trees of Infinite Height
• COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS II: DEGREE SPECTRA
• On a question of Slaman and Groszek

Cites work

• Classes of structures with universe a subset of \(\omega _{1}\)
• scientific article; zbMATH DE number 6536307 (Why is no real title available?)
• scientific article; zbMATH DE number 194101 (Why is no real title available?)
• scientific article; zbMATH DE number 1226875 (Why is no real title available?)
• scientific article; zbMATH DE number 3348085 (Why is no real title available?)
• scientific article; zbMATH DE number 3023012 (Why is no real title available?)
• Metarecursive sets
• Negative solutions to Post's problem. II
• Ordinal machines and admissible recursion theory
• Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
• Reverse mathematics, countable and uncountable
• Techniques of admissible recursion theory
• The fine structure of the constructible hierarchy
• The Role of True Finiteness in the Admissible Recursively Enumerable Degrees
• ∏ 0 1 Classes and Degrees of Theories

Cited in

(8)

• scientific article; zbMATH DE number 1696443 (Why is no real title available?)
• scientific article; zbMATH DE number 6680130 (Why is no real title available?)
• The computable dimension of trees of infinite height
• Local computability and uncountable structures
• On a question of Slaman and Groszek
• Rungs and trees
• The Computable Dimension of I-Trees of Infinite Height
• Computable trees of Scott rank ω₁^CK, and computable approximation

This page was built for publication: Computability in uncountable binary trees

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