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

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

Mathematics Subject Classification ID

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

Review text

In this very interesting paper it is proved that: (i) A recursively enumerable degree is contiguous iff it is locally distributive. This settles an old question going back to Ladner and Sasso. An enumerable Turing degree in which all the (not necessarily enumerable) sets are of the same weak truth table degree is strongly contiguous. (ii) The notions of strong contiguity and continuity coincide. This settles a question of R. G. Downey. (iii) No \(m\)-topped degree is contiguous. This settles a question of R. G. Downey and C. Jockusch.

Recommendations

• scientific article; zbMATH DE number 3895050
• Maximal contiguous degrees
• The contiguity in R/M.
• Embeddings of N₅ 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)

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