On the Quotient Structure of Computably Enumerable Degrees Modulo the Noncuppable Ideal
نویسندگان
چکیده
We show that minimal pairs exist in the quotient structure of R modulo the ideal of noncuppable degrees. In the study of mathematical structures it is very common to form quotient structures by identifying elements in some equivalence classes. By varying the equivalence relations, the corresponding quotient structures often reveal certain hidden features of the original structure. In this paper, we focus on of the upper semi-lattice of computably enumerable degrees and the equivalence relations are induced by definable ideals. We begin with introducing some notations and terminologies. Let R be the class of computably enumerable degrees or simply c.e. degrees. Definition 1. We say that a nonempty subset I of R is an ideal of R if I is downward closed and closed under join. In other words, the following conditions are satisfied. (a) If a is in I and b ≤ a then b is in I; (b) If a and b are in I, then their least upper bound, denoted by a ∨ b, is in I. We say that an ideal I is definable if there is a first-order formula φ(x) over the partial order language L = {≤} such that a c.e. degree a ∈ I if and only if R |= φ(a). Each ideal I of R naturally induced an equivalence relation ≡I as follows. For any two c.e. degrees a and b, define a ≤I b if and only if ∃x ∈ I(a ≤T b ∨ x), 1991 Mathematics Subject Classification. 03D25. A. Li is partially supported by National Distinguished Young Investigator Award no. 60325206 (China). Y. Yang is partially supported by NUS Academic Research Grant R-146-000-078-112 “Enumerability and Reducibility” (Singapore) and R252-000-212-112. G. Wu is partially supported by a start-up grant from Nanyang Technological University (Singapore). All three authors are partially supported by NSFC grant no. 60310213 “New Directions in Theory and Applications of Models of Computation” (China). The work was done partially while the authors were visiting the Institute for Mathematical Sciences, National University of Singapore in 2005. The visit was supported by the Institute.
منابع مشابه
Computably Enumerable Reals and Uniformly Presentable Ideals
We study the relationship between a computably enumerable real and its presentations. A set A presents a computably enumerable real α if A is a computably enumerable prefix-free set of strings such that α = ∑ σ∈A 2 −|σ|. Note that ∑ σ∈A 2 −|σ| is precisely the measure of the set of reals that have a string in A as an initial segment. So we will simply abbreviate ∑ σ∈A 2 −|σ| by μ(A). It is know...
متن کاملUniversal Cupping Degrees
Cupping nonzero computably enumerable (c.e. for short) degrees to 0′ in various structures has been one of the most important topics in the development of classical computability theory. An incomplete c.e. degree a is cuppable if there is an incomplete c.e. degree b such that a∪b = 0′, and noncuppable if there is no such degree b. Sacks splitting theorem shows the existence of cuppable degrees....
متن کاملBiprojectivty of Banach algebras modulo an ideal
In this paper, we introduce the new concept of biprojectivity of a Banach algebra modulo an ideal, as a generalization of this notion in the classical case. By using it , we obtain some necessary and sufficient conditions for contractibility of Banach algebras modulo an ideal. In particular we characterize the contractibility of quotient Banach algebras. Also we study the relationship between t...
متن کاملUpper bounds on ideals in the computably enumerable Turing degrees
We study ideals in the computably enumerable Turing degrees, and their upper bounds. Every proper Σ0 4 ideal in the c.e. Turing degrees has an incomplete upper bound. It follows that there is no Σ0 4 prime ideal in the c.e. Turing degrees. This answers a question of Calhoun (1993) [2]. Every properΣ0 3 ideal in the c.e. Turing degrees has a low2 upper bound. Furthermore, the partial order of Σ0...
متن کاملOn the filter of computably enumerable supersets of an r-maximal set
We study the lter L (A) of computably enumerable supersets (modulo nite sets) of an r-maximal set A and show that, for some such set A, the property of being co nite in L (A) is still 0 3 -complete. This implies that for this A, there is no uniformly computably enumerable \tower" of sets exhausting exactly the coin nite sets in L (A).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006