Nonbounding and Slaman triples

DOI10.1016/0168-0072(95)00044-5zbMath0855.03024OpenAlexW2066933382MaRDI QIDQ1919544

Steven D. Leonhardi

Publication date: 23 July 1996

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(95)00044-5

zbMATH Keywords

recursively enumerable degreesdefinability of jump classesSlaman triple

Mathematics Subject Classification ID

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

Cites Work

• Working below a \(low_ 2\) recursively enumerable degree
• Minimal pairs in initial segments of the recursively enumerable degrees
• The decidability of the existential theory of the poset of recursively enumerable degrees with jump relations
• Interpolation and embedding in the recursively enumerable degrees
• On the degrees less than 0'
• Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets
• The jump is definable in the structure of the degrees of unsolvability
• Defining Jump Classes in the Degrees Below 0'
• Minimal pairs and high recursively enumerable degrees
• A recursively enumerable degree which will not split over all lesser ones
• Recursively enumerable sets and degrees
• Working below a high recursively enumerable degree
• Highness and bounding minimal pairs
• Degree theoretic definitions of the low₂ recursively enumerable sets
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability

This page was built for publication: Nonbounding and Slaman triples