Abstract
We survey known results on spectra of structures and on spectra of relations on computable structures, asking when the set of all highn degrees can be such a spectrum, and likewise for the set of non-lown degrees. We then repeat these questions specifically for linear orders and for relations on the computable dense linear order ℚ. New results include realizations of the set of non-lown Turing degrees as the spectrum of a relation on ℚ for all n≥1, and a realization of the set of all non-lown Turing degrees as the spectrum of a linear order whenever n≥2. The state of current knowledge is summarized in a table in the concluding section.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
