The recursively enumerable degrees have infinitely many one-types

DOI10.1016/0168-0072(89)90042-0zbMath0682.03024OpenAlexW2057628387WikidataQ126463979 ScholiaQ126463979MaRDI QIDQ1823931

Robert I. Soare, Ambos-Spies, Klaus

Publication date: 1989

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(89)90042-0

zbMATH Keywords

minimal pairr.e. degreesmany-one types

Mathematics Subject Classification ID

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

Related Items (12)

Structural interactions of the recursively enumerable T- and W-degrees ⋮ Intervals and sublattices of the r.e. weak truth table degrees. I: Density ⋮ Classification of degree classes associated with r.e. subspaces ⋮ The theory of the recursively enumerable weak truth-table degrees is undecidable ⋮ On the Strongly Bounded Turing Degrees of the Computably Enumerable Sets ⋮ Generalized nonsplitting in the recursively enumerable degrees ⋮ Contiguity and distributivity in the enumerable Turing degrees ⋮ Undecidability and 1-types in the recursively enumerable degrees ⋮ On the definable ideal generated by nonbounding c.e. degrees ⋮ Degree Structures: Local and Global Investigations ⋮ Interpreting \(\mathbb{N}\) in the computably enumerable weak truth table degrees ⋮ Undecidability and 1-types in intervals of the computably enumerable degrees

Cites Work

• Wtt-degrees and T-degrees of r.e. sets
• Bounding minimal pairs
• A minimal pair of recursively enumerable degrees
• Lower Bounds for Pairs of Recursively Enumerable Degrees
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The recursively enumerable degrees have infinitely many one-types