Elementary differences among jump classes
From MaRDI portal
Publication:1007245
DOI10.1016/J.TCS.2008.10.029zbMATH Open1162.03023OpenAlexW2056553038MaRDI QIDQ1007245FDOQ1007245
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
Cites Work
- The recursively enumerable degrees are dense
- Title not available (Why is that?)
- Classes of Recursively Enumerable Sets and Degrees of Unsolvability
- On a Theorem of Lachlan and Martin
- Interpretability and Definability in the Recursively Enumerable Degrees
- Recursive Enumerability and the Jump Operator
- The \(\text{low}_n\) and \(\text{low}_m\) r.e. degrees are not elementarily equivalent
- Interpolation and embedding in the recursively enumerable degrees
- A recursively enumerable degree which will not split over all lesser ones
- Jump restricted interpolation in the recursively enumerable degrees
- Working below a \(low_ 2\) recursively enumerable degree
- Title not available (Why is that?)
- Bounding minimal pairs
- Minimal pairs and high recursively enumerable degrees
- Highness and bounding minimal pairs
- Splitting and nonsplitting, II: A low2 c.e. degree above which 0′ is not splittable
- An almost deep degree
- A join theorem for the computably enumerable degrees
- On a question of G. E. Sacks
- On a Problem of G. E. Sacks
Cited In (1)
Recommendations
This page was built for publication: Elementary differences among jump classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1007245)
