Embedding jump upper semilattices into the Turing degrees
نویسنده
چکیده
We prove that every countable jump upper semilattice can be embedded in D, where a jump upper semilattice (jusl) is an upper semilattice endowed with a strictly increasing and monotone unary operator that we call jump, and D is the jusl of Turing degrees. As a corollary we get that the existential theory of 〈D,≤T ,∨, ′〉 is decidable. We also prove that this result is not true about jusls with 0, by proving that not every quantifier free 1-type of jusl with 0 is realized in D. On the other hand, we show that every quantifier free 1-type of jump partial ordering (jpo) with 0 is realized in D. Moreover, we show that if every quantifier free type, p(x1, ..., xn), of jpo with 0, which contains the formula x1 ≤ 0(m) & ... & xn ≤ 0(m) for some m, is realized in D, then every every quantifier free type of jpo with 0 is realized in D. We also study the question of whether every jusl with the c.p.p. and size κ ≤ 2א0 is embeddable in D. We show that for κ = 2א0 the answer is no, and that for κ = א1 it is independent of ZFC. (It is true if MA(κ) holds.) §
منابع مشابه
A Jump Inversion Theorem for the Semilattices of Sigma-degrees
We prove an analogue of the jump inversion theorem for the semilattices of Σ-degrees of structures. As a corollary, we get similar result for the semilattices of degrees of presentability of countable structures.
متن کاملOn the Symmetric Enumeration Degrees
A set A is symmetric enumeration (se-) reducible to a set B (A≤seB) if A is enumeration reducible to B and A is enumeration reducible to B. This reducibility gives rise to a degree structure (Dse) whose least element is the class of computable sets. We give a classification of ≤se in terms of other standard reducibilities and we show that the natural embedding of the Turing degrees (DT) into th...
متن کاملOn the jump classes of noncuppable enumeration degrees
We prove that for every Σ2 enumeration degree b there exists a noncuppable Σ2 degree a > 0e such that b ′ ≤e a′ and a′′≤e b′′. This allows us to deduce, from results on the high/low jump hierarchy in the local Turing degrees and the jump preserving properties of the standard embedding ι : DT → De, that there exist Σ2 noncuppable enumeration degrees at every possible—i.e. above low1—level of the...
متن کاملKalimullin Pairs of Σ2 Ω-enumeration Degrees
We study the notion of K-pairs in the local structure of the ωenumeration degrees. We introduce the notion of super almost zero sequences and investigate their structural properties. The study of degree structures has been one of the central themes in computability theory. Although the main focus has been on the structure of the Turing degrees and its local substructure, of the degrees below th...
متن کاملEventually Infinite Time Turing Machine Degrees: Infinite Time Decidable Reals
We characterise explicitly the decidable predicates on integers of Innnite Time Turing machines, in terms of admissibility theory and the constructible hierarchy. We do this by pinning down , the least ordinal not the length of any eventual output of an Innnite Time Turing machine (halting or otherwise); using this the Innnite Time Turing Degrees are considered, and it is shown how the jump ope...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Log.
دوره 68 شماره
صفحات -
تاریخ انتشار 2003