Elementary differences among jump classes

DOI10.1016/j.tcs.2008.10.029zbMath1162.03023OpenAlexW2056553038MaRDI QIDQ1007245

Ang Sheng Li

Publication date: 20 March 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.10.029

zbMATH Keywords

Turing jumpcomputably enumerable setsTuring degrees

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Working below a \(low_ 2\) recursively enumerable degree
• The \(\text{low}_n\) and \(\text{low}_m\) r.e. degrees are not elementarily equivalent
• The recursively enumerable degrees are dense
• Interpolation and embedding in the recursively enumerable degrees
• Jump restricted interpolation in the recursively enumerable degrees
• An almost deep degree
• Interpretability and Definability in the Recursively Enumerable Degrees
• Bounding minimal pairs
• Minimal pairs and high recursively enumerable degrees
• A recursively enumerable degree which will not split over all lesser ones
• Highness and bounding minimal pairs
• Splitting and nonsplitting, II: A low₂ c.e. degree above which 0′ is not splittable
• A join theorem for the computably enumerable degrees
• On a question of G. E. Sacks
• On a Theorem of Lachlan and Martin
• On a Problem of G. E. Sacks
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• Recursive Enumerability and the Jump Operator

This page was built for publication: Elementary differences among jump classes