Working below a high recursively enumerable degree

DOI10.2307/2275099zbMath0797.03043OpenAlexW2077721565MaRDI QIDQ4276023

Richard A. Shore, Theodore A. Slaman

Publication date: 19 January 1994

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2275099

zbMATH Keywords

high recursively enumerable degreeSlaman triplerecursively enumerable objects below high r.e. degrees

Mathematics Subject Classification ID

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

Related Items

NONSTANDARD MODELS IN RECURSION THEORY AND REVERSE MATHEMATICS, Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree, Nonbounding and Slaman triples, The jump is definable in the structure of the degrees of unsolvability, On strongly jump traceable reals, The density of the low\(_ 2\) \(n\)-r.e. degrees, Extending the Cooper minimal pair theorem, On the existence of a strong minimal pair, The existence of high nonbounding degrees in the difference hierarchy

Cites Work

• Unnamed Item
• Working below a \(low_ 2\) recursively enumerable degree
• The jump is definable in the structure of the degrees of unsolvability
• The undecidability of the recursively enumerable degrees
• Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
• Initial segments of degrees below 0′
• Minimal degrees and the jump operator
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability