Contiguity and distributivity in the enumerable Turing degrees

DOI10.2307/2275639zbMath0897.03047OpenAlexW2069623377MaRDI QIDQ4382472

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)

Related Items (9)

Nonlowness is independent from fickleness ⋮ 2000 Annual Meeting of the Association for Symbolic Logic ⋮ On the Strongly Bounded Turing Degrees of the Computably Enumerable Sets ⋮ TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES ⋮ A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES ⋮ Irreducible, singular, and contiguous degrees ⋮ Embeddings of \(N_5\) and the contiguous degrees ⋮ Hierarchy of Computably Enumerable Degrees II ⋮ Completing pseudojump operators

Cites Work

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

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