The arithmetic and Turing degrees are not elementarily equivalent

DOI10.1007/BF02007145MaRDI QIDQ3765755zbMATH OpenFDO

Authors Richard A. Shore

Publication date 1984

Published in Archiv für Mathematische Logik und Grundlagenforschung (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/138027

zbMATH Keywords

arithmetic degreescone of degreeselementary theoriessecond-order arithmeticTuring degrees

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3861135
• scientific article; zbMATH DE number 66485
• Interpreting true arithmetic in the theory of the r.e. truth table degrees
• Coding true arithmetic in the Medvedev and Muchnik degrees
• scientific article; zbMATH DE number 4204326

Cites work

• Distributive Initial Segments of the Degrees of Unsolvability
• Initial segments of the degrees of unsolvability Part II: minimal degrees
• On homogeneity and definability in the first-order theory of the Turing degrees
• On the First Order Theory of the Arithmetical Degrees
• Transfinite extensions of Friedberg's completeness criterion

Cited in

(5)

• Interpreting true arithmetic in the theory of the r.e. truth table degrees
• scientific article; zbMATH DE number 3861135 (Why is no real title available?)
• Amenable equivalence relations and Turing degrees
• scientific article; zbMATH DE number 4061229 (Why is no real title available?)
• The Turing degrees: an introduction

This page was built for publication: The arithmetic and Turing degrees are not elementarily equivalent

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