On the First Order Theory of the Arithmetical Degrees

DOI10.2307/2043640zbMath0554.03023OpenAlexW4244451074MaRDI QIDQ3216640

Piergiorgio Odifreddi

Publication date: 1983

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

zbMATH Keywords

Turing degreesarithmetical degreesarithmetical jump

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items

The arithmetic and Turing degrees are not elementarily equivalent ⋮ Strong reducibilities ⋮ Upper semilattice of recursively enumerable Q-degrees

Cites Work

• On degrees of unsolvability
• Recursive well-orderings
• Forcing and reducibilities. III. Forcing in fragments of set theory
• Minimal Covers and Hyperdegrees
• The axiom of determinateness and reduction principles in the analytical hierarchy
• A note on the hyperarithmetical hierarchy