Document Type

Article

Publication Date

2007

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 order. Countable Π01 subsets of 2w and Kolmogorov complexity play a major role in the proof.

Comments

Preprint. Article published in Journal of Symbolic Logic 72 (2007) 1003–1018.

Included in

Mathematics Commons

Share

COinS