Pseudo Jump Operators. I: The R. E. Case

DOI10.2307/1999041zbMath0514.03028OpenAlexW4242335196MaRDI QIDQ3659772

Richard A. Shore, Carl G. jun. Jockusch

Publication date: 1983

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

r.e. degreesjump operatornon-splitting theoremset of low degreestandard enumeration

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Theory of numerations, effectively presented structures (03D45)

Related Items (22)

Iterated relative recursive enumerability ⋮ Maximal theories ⋮ On the problem of the critical bound ⋮ HTP-COMPLETE RINGS OF RATIONAL NUMBERS ⋮ A non-inversion theorem for the jump operator ⋮ Strong jump-traceability. II: \(K\)-triviality ⋮ STRONG JUMP-TRACEABILITY ⋮ The jump is definable in the structure of the degrees of unsolvability ⋮ Continuous randomness via transformations of 2-random sequences ⋮ On the jumps of the degrees below a recursively enumerable degree ⋮ There is no degree invariant half-jump ⋮ On Lachlan's major sub-degree problem ⋮ Isolation in the CEA hierarchy ⋮ Precomplete numberings ⋮ Lattice nonembeddings and intervals of the recursively enumerable degrees ⋮ Measure-theoretic applications of higher Demuth’s Theorem ⋮ Mass problems associated with effectively closed sets ⋮ Extensions of embeddings below computably enumerable degrees ⋮ Lowness properties and randomness ⋮ Completing pseudojump operators ⋮ Splitting theorems in recursion theory ⋮ On the structure of the degrees of relative provability

This page was built for publication: Pseudo Jump Operators. I: The R. E. Case