On the first order theory of the arithmetical degrees
HTML articles powered by AMS MathViewer
- by Piergiorgio Odifreddi PDF
- Proc. Amer. Math. Soc. 87 (1983), 505-507 Request permission
Abstract:
The first order theory of the arithmetical degrees with arithmetical jump is not elementarily equivalent to the first order theory of the Turing degrees with jump.References
- H. B. Enderton and Hilary Putnam, A note on the hyperarithmetical hierarchy, J. Symbolic Logic 35 (1970), 429–430. MR 290971, DOI 10.2307/2270699 Harding, Forcing in recursion theory, Ph. D. Thesis, University College of Swansea, 1974.
- Donald A. Martin, The axiom of determinateness and reduction principles in the analytical hierarchy, Bull. Amer. Math. Soc. 74 (1968), 687–689. MR 227022, DOI 10.1090/S0002-9904-1968-11995-0
- Piergiorgio Odifreddi, Forcing and reducibilities, J. Symbolic Logic 48 (1983), no. 2, 288–310. MR 704084, DOI 10.2307/2273547
- Hartley Rogers Jr., Theory of recursive functions and effective computability, McGraw-Hill Book Co., New York-Toronto, Ont.-London, 1967. MR 0224462
- Gerald E. Sacks, Forcing with perfect closed sets, Axiomatic Set Theory (Proc. Sympos. Pure Math., Vol. XIII, Part I, Univ. California, Los Angeles, Calif., 1967) Amer. Math. Soc., Providence, R.I., 1971, pp. 331–355. MR 0276079
- J. R. Shoenfield, On degrees of unsolvability, Ann. of Math. (2) 69 (1959), 644–653. MR 105355, DOI 10.2307/1970028
- Stephan G. Simpson, Minimal covers and hyperdegrees, Trans. Amer. Math. Soc. 209 (1975), 45–64. MR 392534, DOI 10.1090/S0002-9947-1975-0392534-3
- Clifford Spector, Recursive well-orderings, J. Symbolic Logic 20 (1955), 151–163. MR 74347, DOI 10.2307/2266902
Additional Information
- © Copyright 1983 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 87 (1983), 505-507
- MSC: Primary 03D30
- DOI: https://doi.org/10.1090/S0002-9939-1983-0684647-3
- MathSciNet review: 684647