Isomorphisms of splits of computably enumerable sets
نویسندگان
چکیده
We show that if A and  are automorphic via 8 then the structures SR(A) and SR( Â) are 13-isomorphic via an isomorphism 9 induced by 8. Then we use this result to classify completely the orbits of hhsimple sets.
منابع مشابه
Isomorphisms of Non-Standard Fields and Ash's Conjecture
Cohesive sets play an important role in computability theory. Here we use cohesive sets to build nonstandard versions of the rationals. We use Koenigsmann’s work on Hilbert’s Tenth Problem to establish that these nonstandard fields are rigid. As a consequence we obtain results about automorphisms of the lattices of computably enumerable vector spaces arising in the context of Ash’s conjecture.
متن کاملDefinable encodings in the computably enumerable sets
The purpose of this communication is to announce some recent results on the computably enumerable sets. There are two disjoint sets of results; the first involves invariant classes and the second involves automorphisms of the computably enumerable sets. What these results have in common is that the guts of the proofs of these theorems uses a new form of definable coding for the computably enume...
متن کاملUniversal computably enumerable sets and initial segment prefix-free complexity
We show that there are Turing complete computably enumerable sets of arbitrarily low non-trivial initial segment prefix-free complexity. In particular, given any computably enumerable set A with non-trivial prefixfree initial segment complexity, there exists a Turing complete computably enumerable set B with complexity strictly less than the complexity of A. On the other hand it is known that s...
متن کاملComputably Enumerable Algebras, Their Expansions, and Isomorphisms
Computably enumerable algebras are the ones whose positive atomic diagrams are computably enumerable. Computable algebras are the ones whose atomic diagrams are computable. In this paper we investigate computably enumerable algebras and provide several algebraic and computable theoretic distinctions of these algebras from the class of computable algebras. We give a characterization of computabl...
متن کاملThe global structure of computably enumerable sets
We will work in the structure of the computably enumerable sets. The language is just inclusion, ⊆. This structure is called E. Our quest is to partially survey our current understanding of the global structure of E and the relationship between E and the computably enumerable degrees and to pose questions whose answers should provide further insight.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Log.
دوره 68 شماره
صفحات -
تاریخ انتشار 2003