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

DOI10.1007/978-3-319-17142-5_5MaRDI QIDQ2948451zbMATH OpenOpenAlexFDO

Authors Nadine Losert

Publication date 30 September 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-17142-5_5

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
• T-Degrees, Jump Classes, and Strong Reducibilities
• Joins and meets in the partial orders of the computably enumerable ibT- and cl-degrees
• Semilattices of disjunctive and linear degrees
• Definable Filters in the Structure of Bounded Turing Reductions

Cited in

(3)

• Joining non-low C.E. sets with diagonally non-computable functions
• Where join preservation fails in the bounded Turing degrees of c.e. sets
• Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega

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 Q2948451)