Computably enumerable Turing degrees and the meet property

DOI10.1090/PROC/12808MaRDI QIDQ2790280zbMATH OpenOpenAlexFDO

Authors Benedict Durrant, Andrew E. M. Lewis, Keng Meng Ng, James Riley

Publication date 3 March 2016

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL http://eprints.lse.ac.uk/65480/1/Computably%20enumerable%20Turing%20degrees.pdf

zbMATH Keywords

recursively enumerable setsmeet property

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Recommendations

• A join theorem for the computably enumerable degrees
• Joins and meets in the partial orders of the computably enumerable ibT- and cl-degrees
• Minimal weak truth table degrees and computably enumerable Turing degrees
• Generating sets for the recursively enumerable Turing degrees
• Splitting and jump inversion in the Turing degrees

Cites work

• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 1955470 (Why is no real title available?)
• scientific article; zbMATH DE number 1390014 (Why is no real title available?)
• Bounding minimal degrees by computably enumerable degrees
• Complementation in the Turing degrees
• Complementing below recursively enumerable degrees
• Degrees of unsolvability: structure and theory
• Initial segments of degrees below 0′
• Minimal complements for degrees below 0′
• On a problem of Cooper and Epstein
• Properties of the jump classes
• The search for natural definability in the Turing degrees
• The strong anticupping property for recursively enumerable degrees
• The upper semi-lattice of degrees of recursive unsolvability

Cited in

(5)

• The minimal complementation property above 0′
• An effectively closed set with no join property*
• A note on the join property
• A measure-theoretic proof of Turing incomparability
• A single minimal complement for the c.e. degrees

This page was built for publication: Computably enumerable Turing degrees and the meet property

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