Π10 classes and strong degree spectra of relations

@article{Chisholm200710CA,
  title={Π10 classes and strong degree spectra of relations},
  author={John Chisholm and Jennifer Chubb and Valentina S. Harizanov and Denis R. Hirschfeldt and Carl G. Jockusch and Timothy H. McNicholl and Sarah Pingrey},
  journal={J. Symb. Log.},
  year={2007},
  volume={72},
  pages={1003-1018}
}
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 order. Countable Π1 subsets of 2 ω and Kolmogorov complexity play a major role in the proof. 

From This Paper

Topics from this paper.
5 Citations
38 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 38 references

The ranked members of a Π1 set

  • D. Cenzer, R. Smith
  • Journal of Symbolic Logic 54
  • 1989
Highly Influential
3 Excerpts

Jr

  • C. G. Jockusch
  • and R. I. Soare, Π1 classes and degrees of…
  • 1972
Highly Influential
5 Excerpts

Computable Structures and the Hyperarithmetical Hierarchy (Elsevier

  • C. J. Ash, J. F. Knight
  • 2000
1 Excerpt

Similar Papers

Loading similar papers…