Article contents
Π10 classes and strong degree spectra of relations
Published online by Cambridge University Press: 12 March 2014
Abstract
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 subsets of 2ω and Kolmogorov complexity play a major role in the proof.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 2007
References
REFERENCES
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151019082756894-0270:S0022481200005181_inline4.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151019082756894-0270:S0022481200005181_inline2.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151019082756894-0270:S0022481200005181_inline2.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151019082756894-0270:S0022481200005181_inline2.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151019082756894-0270:S0022481200005181_inline5.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151019082756894-0270:S0022481200005181_inline5.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151019082756894-0270:S0022481200005181_inline3.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151019082756894-0270:S0022481200005181_inline2.gif?pub-status=live)
- 3
- Cited by