On the strongly bounded Turing degrees of the computably enumerable sets

DOI10.1007/978-3-319-50062-1_34MaRDI QIDQ2970980zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(13)

• scientific article; zbMATH DE number 1390084 (Why is no real title available?)
• 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
• scientific article; zbMATH DE number 4130363 (Why is no real title available?)
• ∑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

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)