Translator Disclaimer
September 2007 Π10 classes and strong degree spectra of relations
John Chisholm, Jennifer Chubb, Valentina S. Harizanov, Denis R. Hirschfeldt, Carl G., Jr. Jockusch, Timothy McNicholl, Sarah Pingrey
J. Symbolic Logic 72(3): 1003-1018 (September 2007). DOI: 10.2178/jsl/1191333852

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 Π10 subsets of 2ω and Kolmogorov complexity play a major role in the proof.

Citation

Download Citation

John Chisholm. Jennifer Chubb. Valentina S. Harizanov. Denis R. Hirschfeldt. Carl G., Jr. Jockusch. Timothy McNicholl. Sarah Pingrey. "Π10 classes and strong degree spectra of relations." J. Symbolic Logic 72 (3) 1003 - 1018, September 2007. https://doi.org/10.2178/jsl/1191333852

Information

Published: September 2007
First available in Project Euclid: 2 October 2007

zbMATH: 1123.03025
MathSciNet: MR2354911
Digital Object Identifier: 10.2178/jsl/1191333852

Rights: Copyright © 2007 Association for Symbolic Logic

JOURNAL ARTICLE
16 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.72 • No. 3 • September 2007
Back to Top