The recursively enumerable degrees have infinitely many one-types

DOI10.1016/0168-0072(89)90042-0zbMATH Open0682.03024OpenAlexW2057628387WikidataQ126463979 ScholiaQ126463979MaRDI QIDQ1823931FDOQ1823931

Authors: Robert I. Soare, Klaus Ambos-Spies 

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

Recommendations

• On Pairs of Recursively Enumerable Degrees
• Undecidability and 1-types in the recursively enumerable degrees
• On the r. e. predecessors of d. r. e. degrees
• scientific article; zbMATH DE number 3845569
• The elementary theory of the recursively enumerable degrees is not \(\aleph _ 0\)-categorical

zbMATH Keywords

minimal pairr.e. degreesmany-one types

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Lower Bounds for Pairs of Recursively Enumerable Degrees
• A minimal pair of recursively enumerable degrees
• Title not available (Why is that?)
• Bounding minimal pairs
• Title not available (Why is that?)
• Wtt-degrees and T-degrees of r.e. sets

Cited In (16)

• Undecidability and 1-types in intervals of the computably enumerable degrees
• Classification of degree classes associated with r.e. subspaces
• Undecidability and 1-types in the recursively enumerable degrees
• The theory of the recursively enumerable weak truth-table degrees is undecidable
• On the definable ideal generated by nonbounding c.e. degrees
• Generalized nonsplitting in the recursively enumerable degrees
• Title not available (Why is that?)
• THE THEORY OF THE METARECURSIVELY ENUMERABLE DEGREES
• Intervals and sublattices of the r.e. weak truth table degrees. I: Density
• Degree Structures: Local and Global Investigations
• Contiguity and distributivity in the enumerable Turing degrees
• Model theory of the computably enumerable many-one degrees
• Interpreting \(\mathbb{N}\) in the computably enumerable weak truth table degrees
• On the strongly bounded Turing degrees of the computably enumerable sets
• Correction to “Simple r. e. degree structures”
• Structural interactions of the recursively enumerable T- and W-degrees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1823931)