The arithmetic and Turing degrees are not elementarily equivalent
From MaRDI portal
Publication:3765755
DOI10.1007/BF02007145zbMath0629.03018MaRDI QIDQ3765755
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
Cites Work
- On the First Order Theory of the Arithmetical Degrees
- On homogeneity and definability in the first-order theory of the Turing degrees
- Transfinite extensions of Friedberg's completeness criterion
- Distributive Initial Segments of the Degrees of Unsolvability
- Initial segments of the degrees of unsolvability Part II: minimal degrees