There is no degree invariant half-jump

DOI10.1090/S0002-9939-97-03915-4zbMath0881.03024OpenAlexW1521875818MaRDI QIDQ4356714

Richard A. Shore, Rodney G. Downey

Publication date: 1 October 1997

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

Full work available at URL: https://doi.org/10.1090/s0002-9939-97-03915-4

zbMATH Keywords

computably enumerable degreesMartin's conjectureaxiom of determinacyrecursively enumerable degreesPost's problemdegree invariant operators

Mathematics Subject Classification ID

Descriptive set theory (03E15) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Determinacy principles (03E60)

Related Items

The uniform Martin’s conjecture for many-one degrees ⋮ RELATIVIZING CHAITIN'S HALTING PROBABILITY

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Borel determinacy
• Cabal seminar 76-77. Proceedings, Caltech-UCLA logic seminar 1976-77
• A classification of jump operators
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
• Pseudo Jump Operators. I: The R. E. Case
• A characterization of jump operators
• Uniform enumeration operations
• Degrees of Unsolvability. (AM-55)
• The axiom of determinateness and reduction principles in the analytical hierarchy
• Recursively enumerable sets of positive integers and their decision problems

This page was built for publication: There is no degree invariant half-jump