Computably enumerable Turing degrees and the meet property
From MaRDI portal
Publication:2790280
DOI10.1090/PROC/12808zbMATH Open1346.03043OpenAlexW1654606651MaRDI QIDQ2790280FDOQ2790280
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
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- The upper semi-lattice of degrees of recursive unsolvability
- Complementation in the Turing degrees
- The strong anticupping property for recursively enumerable degrees
- Bounding minimal degrees by computably enumerable degrees
- Degrees of unsolvability: structure and theory
- Complementing below recursively enumerable degrees
- Initial segments of degrees below 0′
- Minimal complements for degrees below 0′
- Title not available (Why is that?)
- Properties of the jump classes
- On a problem of Cooper and Epstein
- The search for natural definability in the Turing degrees
Cited In (5)
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)
