Computably enumerable Turing degrees and the meet property

DOI10.1090/PROC/12808zbMath1346.03043OpenAlexW1654606651MaRDI QIDQ2790280

No author found.

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Degrees of unsolvability: structure and theory
• Complementing below recursively enumerable degrees
• The upper semi-lattice of degrees of recursive unsolvability
• Properties of the jump classes
• Complementation in the Turing degrees
• Initial segments of degrees below 0′
• Bounding minimal degrees by computably enumerable degrees
• On a problem of Cooper and Epstein
• The search for natural definability in the Turing degrees
• The strong anticupping property for recursively enumerable degrees
• Minimal complements for degrees below 0′

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