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

DOI10.1016/J.IC.2017.07.005MaRDI QIDQ2407100zbMATH OpenOpenAlexFDO

Authors Nadine Losert

Publication date 28 September 2017

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2017.07.005

zbMATH Keywords

computably enumerable setsbounded Turing reducibilitycl-reducibilityibT-reducibility

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28) Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• Where join preservation fails in the bounded Turing degrees of c.e. sets
• Joins and meets in the partial orders of the computably enumerable ibT- and cl-degrees
• T-Degrees, Jump Classes, and Strong Reducibilities
• Definable Filters in the Structure of Bounded Turing Reductions
• On the strongly bounded Turing degrees of the computably enumerable sets

Cites work

• scientific article; zbMATH DE number 3954890 (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
• Embedding the Diamond Lattice in the Recursively Enumerable Truth-Table Degrees
• Initial Segments of Many-One Degrees
• Maximal pairs of computably enumerable sets in the computably Lipschitz degrees
• New Computational Paradigms
• On Reducibility by Recursive Functions
• On the strongly bounded Turing degrees of the computably enumerable sets
• Random reals and Lipschitz continuity
• Randomness and reducibility
• Some properties of sw-reducibility
• Strong reducibilities
• Structural interactions of the recursively enumerable T- and W-degrees
• The computable Lipschitz degrees of computably enumerable sets are not dense
• The ibT degrees of computably enumerable sets are not dense
• The weak truth table degrees of recursively enumerable sets
• Where join preservation fails in the bounded Turing degrees of c.e. sets

Cited in

(3)

• Joining non-low C.E. sets with diagonally non-computable functions
• Joins and meets in the partial orders of the computably enumerable ibT- and cl-degrees
• Where join preservation fails in the bounded Turing degrees of c.e. sets

This page was built for publication: Where join preservation fails in the bounded Turing degrees of c.e. sets

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