On the First Order Theory of the Arithmetical Degrees

DOI10.2307/2043640zbMATH Open0554.03023OpenAlexW4244451074MaRDI QIDQ3216640FDOQ3216640

Authors: 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)

Cites Work

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

Cited In (8)

• A fixed point for the jump operator on structures
• Title not available (Why is that?)
• Strong reducibilities
• Upper semilattice of recursively enumerable Q-degrees
• Title not available (Why is that?)
• The arithmetic and Turing degrees are not elementarily equivalent
• Towards a theory of arithmetic degrees
• Low level nondefinability results: domination and recursive enumeration

This page was built for publication: On the First Order Theory of the Arithmetical Degrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3216640)