Contiguity and distributivity in the enumerable Turing degrees

DOI10.2307/2275639MaRDI QIDQ4382472zbMATH OpenOpenAlexFDO

Authors Steffen Lempp, Rodney G. Downey

Publication date 19 October 1998

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2275639

zbMATH Keywords

recursively enumerable degreecontiguous degree\(m\)-topped degreeenumerable Turing degree

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3895050
• Maximal contiguous degrees
• The contiguity in R/M.
• Embeddings of \(N_5\) and the contiguous degrees

Cites work

• A Contiguous Nonbranching Degree
• Anti‐Mitotic Recursively Enumerable Sets
• Classification of degree classes associated with r.e. subspaces
• Completely mitotic r. e. degrees
• Lattice nonembeddings and intervals of the recursively enumerable degrees
• Localization of a theorem of Ambos-Spies and the strong anti-splitting property
• Reducibility and Completeness for Sets of Integers
• Splitting properties of r.e. sets and degrees
• Splitting theorems in recursion theory
• Strong reducibilities
• Structural interactions of the recursively enumerable T- and W-degrees
• Subsets of hypersimple sets
• The density of infima in the recursively enumerable degrees
• The recursively enumerable degrees have infinitely many one-types
• The universal splitting property. II
• The weak truth table degrees of recursively enumerable sets

Cited in

(16)

• Completing pseudojump operators
• On the strongly bounded Turing degrees of the computably enumerable sets
• TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES
• ∑1-Density and Turing Degrees
• 2000 Annual Meeting of the Association for Symbolic Logic
• scientific article; zbMATH DE number 3895050 (Why is no real title available?)
• A hierarchy of computably enumerable degrees
• Hierarchy of Computably Enumerable Degrees II
• The contiguity in R/M.
• Irreducible, singular, and contiguous degrees
• Turing determinacy and the continuum hypothesis
• Nonlowness is independent from fickleness
• The density of noncontiguous degrees
• Embeddings of \(N_5\) and the contiguous degrees
• An extension of the recursively enumerable Turing degrees
• Maximal contiguous degrees

This page was built for publication: Contiguity and distributivity in the enumerable Turing degrees

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