A characterization of the 0-basis homogeneous bounding degrees

DOI10.2178/JSL/1278682211zbMath1213.03045OpenAlexW2118173716MaRDI QIDQ4931102

Karen Lange

Publication date: 4 October 2010

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

Full work available at URL: https://doi.org/10.2178/jsl/1278682211

zbMATH Keywords

countable modelhomogeneous model\(\Delta _{2}^{0}\) degreeslow\(_{2}\) degrees

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Computable structure theory, computable model theory (03C57)

Related Items (1)

Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Computability of homogeneous models
• Homogeneous models and decidability
• Computable structures and the hyperarithmetical hierarchy
• The degree spectra of homogeneous models
• The atomic model theorem and type omitting
• Degrees coded in jumps of orderings
• Foundations of recursive model theory
• Degrees in Which the Recursive Sets are Uniformly Recursive

This page was built for publication: A characterization of the 0-basis homogeneous bounding degrees