On the First Order Theory of the Arithmetical Degrees

DOI10.2307/2043640MaRDI QIDQ3216640zbMATHOpenAlexFDO

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

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

Cited in

(8)

• Low level nondefinability results: domination and recursive enumeration
• scientific article; zbMATH DE number 5251297 (Why is no real title available?)
• Upper semilattice of recursively enumerable Q-degrees
• A fixed point for the jump operator on structures
• Towards a theory of arithmetic degrees
• scientific article; zbMATH DE number 3884151 (Why is no real title available?)
• The arithmetic and Turing degrees are not elementarily equivalent
• Strong reducibilities

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)