On the Strongly Bounded Turing Degrees of the Computably Enumerable Sets

DOI10.1007/978-3-319-50062-1_34zbMath1485.03145OpenAlexW2559591727MaRDI QIDQ2970980

Ambos-Spies, Klaus

Publication date: 4 April 2017

Published in: Computability and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-50062-1_34

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Computable structure theory, computable model theory (03C57) Other Turing degree structures (03D28)

Related Items (1)

Where join preservation fails in the bounded Turing degrees of c.e. sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The computable Lipschitz degrees of computably enumerable sets are not dense
• Maximal pairs of c.e. reals in the computably Lipschitz degrees
• Structural interactions of the recursively enumerable T- and W-degrees
• \(\Delta\)\( ^ 0_ 2\) degrees and transfer theorems
• Classical recursion theory. Vol. II
• The recursively enumerable degrees have infinitely many one-types
• Randomness and reducibility
• The partial orderings of the computably enumerable ibT-degrees and cl-degrees are not elementarily equivalent
• Maximal pairs of computably enumerable sets in the computably Lipschitz degrees
• The ibT degrees of computably enumerable sets are not dense
• Algorithmic Randomness and Complexity
• Random reals and Lipschitz continuity
• Structures of Some Strong Reducibilities
• Wtt-degrees and T-degrees of r.e. sets
• Cupping and noncapping in the r.e. weak truth table and turing degrees
• The weak truth table degrees of recursively enumerable sets
• Contiguity and distributivity in the enumerable Turing degrees
• Maximal contiguous degrees
• The undecidability of the Π₄-theory for the r.e. wtt and Turing degrees
• Working with strong reducibilities above totally $\omega $-c.e. and array computable degrees
• Sublattices of the Recursively Enumerable Degrees
• New Computational Paradigms
• Computability Theory and Differential Geometry

This page was built for publication: On the Strongly Bounded Turing Degrees of the Computably Enumerable Sets