On the strongly bounded Turing degrees of the computably enumerable sets

DOI10.1007/978-3-319-50062-1_34zbMATH Open1485.03145OpenAlexW2559591727MaRDI QIDQ2970980FDOQ2970980

Authors: Klaus Ambos-Spies 

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

Recommendations

• The partial orderings of the computably enumerable ibT-degrees and cl-degrees are not elementarily equivalent
• On the strongly bounded Turing degrees of simple sets
• Joins and meets in the partial orders of the computably enumerable ibT- and cl-degrees
• Upper bounds on ideals in the computably enumerable Turing degrees
• The ibT degrees of computably enumerable sets are not dense

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (13)

• The ibT degrees of computably enumerable sets are not dense
• \(sQ_1\)-degrees of computably enumerable sets
• New Computational Paradigms
• TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES
• Strong jump-traceability. I: The computably enumerable case
• Title not available (Why is that?)
• ∑1-Density and Turing Degrees
• Joins and meets in the partial orders of the computably enumerable ibT- and cl-degrees
• The computable Lipschitz degrees of computably enumerable sets are not dense
• Upper bounds on ideals in the computably enumerable Turing degrees
• On the strongly bounded Turing degrees of simple sets
• Where join preservation fails in the bounded Turing degrees of c.e. sets
• Title not available (Why is that?)

This page was built for publication: On the strongly bounded Turing degrees of the computably enumerable sets

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