COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS II: DEGREE SPECTRA

DOI10.1017/jsl.2014.69zbMath1359.03035OpenAlexW2041054965MaRDI QIDQ5251362

Asher M. Kach, Noam Greenberg, Steffen Lempp, Daniel D. Turetsky

Publication date: 20 May 2015

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

Full work available at URL: https://semanticscholar.org/paper/6669428817e2cfb7778cb78919a8932cd22811e3

zbMATH Keywords

jump degreedegree spectrumsuccessor relationcomputable order typehereditary countable setomega-1-computability

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)

Related Items (2)

UNIFORM PROCEDURES IN UNCOUNTABLE STRUCTURES ⋮ Finding bases of uncountable free abelian groups is usually difficult

Cites Work

• Unnamed Item
• On the recursive functions of ordinal numbers
• Degrees of orderings not isomorphic to recursive linear orderings
• Pairs of recursive structures
• Recursive linear orders with recursive successivities
• Enumerations in computable structure theory
• Spectra of highn and non-lown degrees
• ON THE COMPLEXITY OF THE SUCCESSIVITY RELATION IN COMPUTABLE LINEAR ORDERINGS
• Enumerations, countable structures and Turing degrees
• [Russian Text Ignored]

This page was built for publication: COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS II: DEGREE SPECTRA