Publication:4382472

DOI10.2307/2275639zbMATH Open0897.03047OpenAlexW2069623377MaRDI QIDQ4382472FDOQ4382472

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)

Cites Work

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

Cited In (12)

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

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)