A splitting theorem for $n-REA$ degrees

DOI10.1090/S0002-9939-01-06015-4zbMath0993.03054MaRDI QIDQ2750871

Richard A. Shore, Theodore A. Slaman

Publication date: 21 October 2001

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

zbMATH Keywords

recursively enumerable setTuring degreedegrees of unsolvability\(n\)-REA degreesdefinability of the jump operator

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Other Turing degree structures (03D28) Hierarchies of computability and definability (03D55)

Related Items (5)

DIRECT AND LOCAL DEFINITIONS OF THE TURING JUMP ⋮ Local Definitions in Degree Structures: The Turing Jump, Hyperdegrees and Beyond ⋮ Turing computability: structural theory ⋮ Model-theoretic properties of Turing degrees in the Ershov difference hierarchy ⋮ Degree Structures: Local and Global Investigations

Cites Work

• Degrees of unsolvability: structure and theory
• Complementing below recursively enumerable degrees
• Handbook of computability theory
• Defining the Turing jump
• On the degrees less than 0'
• On a Conjecture of Kleene and Post
• The jump is definable in the structure of the degrees of unsolvability
• Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
• A recursively enumerable degree which will not split over all lesser ones
• Systems of Logic Based on Ordinals^†

This page was built for publication: A splitting theorem for $n-REA$ degrees