The density of the nonbranching degrees

DOI10.1016/0168-0072(83)90028-3zbMath0521.03026OpenAlexW2055472336MaRDI QIDQ1055403

Peter A. Fejer

Publication date: 1983

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(83)90028-3

zbMATH Keywords

densityrecursively enumerable degreeCantor-Bendixson rankautomorphism basenonbranching degree

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Related Items (21)

Decomposition and infima in the computably enumerable degrees ⋮ Structural interactions of the recursively enumerable T- and W-degrees ⋮ Recursively enumerable \(m\)- and \(tt\)-degrees. II: The distribution of singular degrees ⋮ Splitting properties of r.e. sets and degrees ⋮ Non-p-generic and strongly nonbranching degree ⋮ Degrees containing members of thin Π10 classes are dense and co-dense ⋮ Members of thin Π₁⁰ classes and generic degrees ⋮ Non-p-generic and strongly nonbranching degree ⋮ Initial segments of the lattice of ideals of r.e. degrees ⋮ Branching Degrees above low Degrees ⋮ Branching in the \({\Sigma^0_2}\)-enumeration degrees: a new perspective ⋮ 1996–97 Annual Meeting of the Association for Symbolic Logic ⋮ Infima in the d.r.e. degrees ⋮ Undecidability and 1-types in the recursively enumerable degrees ⋮ The distribution of the generic recursively enumerable degrees ⋮ Infima of d.r.e. Degrees ⋮ Annual Meeting of the Association for Symbolic Logic, Berkeley, 1990 ⋮ Lattice nonembeddings and intervals of the recursively enumerable degrees ⋮ Lattice nonembeddings and initial segments of the recursively enumerable degrees ⋮ Branching in the enumeration degrees of the \(\Sigma_2^0\) sets ⋮ Undecidability and 1-types in intervals of the computably enumerable degrees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The elementary theory of the recursively enumerable degrees is not \(\aleph _ 0\)-categorical
• Not every finite lattice is embeddable in the recursively enumerable degrees
• The recursively enumerable degrees are dense
• On the degrees less than 0'
• The upper semi-lattice of degrees of recursive unsolvability
• The undecidability of the recursively enumerable degrees
• The infinite injury priority method
• A recursively enumerable degree which will not split over all lesser ones
• Lower Bounds for Pairs of Recursively Enumerable Degrees
• Recursively enumerable sets of positive integers and their decision problems

This page was built for publication: The density of the nonbranching degrees