The -spectrum of a linear order

DOI10.2307/2695025zbMath0992.03050OpenAlexW1970404779MaRDI QIDQ2747698

Russell G. Miller

Publication date: 5 September 2002

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

Full work available at URL: https://doi.org/10.2307/2695025

zbMATH Keywords

spectrumstructureslinear orderTuring degrees

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Related Items (11)

Spectral universality of linear orders with one binary relation ⋮ \(A\)-computable graphs ⋮ Some Questions in Computable Mathematics ⋮ A note on \(\Delta_2^0\)-spectra of linear orderings and degree spectra of the successor relation ⋮ Cuts of linear orders ⋮ Degree spectra of real closed fields ⋮ Computability of distributive lattices ⋮ Degree spectra of structures ⋮ Enumerations and completely decomposable torsion-free abelian groups ⋮ ON THE COMPLEXITY OF THE SUCCESSIVITY RELATION IN COMPUTABLE LINEAR ORDERINGS ⋮ Limitwise monotonic sequences and degree spectra of structures

Cites Work

• Unnamed Item
• Degrees of orderings not isomorphic to recursive linear orderings
• Computable homogeneous Boolean algebras
• Degrees coded in jumps of orderings
• Relative to any nonrecursive set
• Enumerations, countable structures and Turing degrees

This page was built for publication: The -spectrum of a linear order