$\Pi _{1}^{0}$ Classes and Strong Degree Spectra of Relations

Journal of Symbolic Logic 72 (3):1003 - 1018 (2007)
We study the weak truth-table and truth-table degrees of the images of subsets of computable structures under isomorphisms between computable structures. In particular, we show that there is a low c.e. set that is not weak truth-table reducible to any initial segment of any scattered computable linear ordering. Countable $\Pi _{1}^{0}$ subsets of 2ω and Kolmogorov complexity play a major role in the proof
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/27588581
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 16,661
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Ned Block (1999). Jack and Jill Have Shifted Spectra. Behavioral and Brain Sciences 22 (6):946-947.
Karen Lange (2008). The Degree Spectra of Homogeneous Models. Journal of Symbolic Logic 73 (3):1009-1028.

Monthly downloads

Sorry, there are not enough data points to plot this chart.

Added to index


Total downloads


Recent downloads (6 months)


How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.