Notre Dame Journal of Formal Logic

Implicit Definability in Arithmetic

Stephen G. Simpson

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Abstract

We consider implicit definability over the natural number system N,+,×,=. We present a new proof of two theorems of Leo Harrington. The first theorem says that there exist implicitly definable subsets of N which are not explicitly definable from each other. The second theorem says that there exists a subset of N which is not implicitly definable but belongs to a countable, explicitly definable set of subsets of N. Previous proofs of these theorems have used finite- or infinite-injury priority constructions. Our new proof is easier in that it uses only a nonpriority oracle construction, adapted from the standard proof of the Friedberg jump theorem.

Article information

Source
Notre Dame J. Formal Logic, Volume 57, Number 3 (2016), 329-339.

Dates
Received: 3 September 2013
Accepted: 8 January 2014
First available in Project Euclid: 30 March 2016

Permanent link to this document
https://projecteuclid.org/euclid.ndjfl/1459343729

Digital Object Identifier
doi:10.1215/00294527-3507386

Mathematical Reviews number (MathSciNet)
MR3521483

Zentralblatt MATH identifier
06621292

Subjects
Primary: 03D55: Hierarchies
Secondary: 03D30: Other degrees and reducibilities 03D28: Other Turing degree structures 03C40: Interpolation, preservation, definability 03D80: Applications of computability and recursion theory

Keywords
arithmetical hierarchy arithmetical singletons implicit definability hyperarithmetical sets Turing jump

Citation

Simpson, Stephen G. Implicit Definability in Arithmetic. Notre Dame J. Formal Logic 57 (2016), no. 3, 329--339. doi:10.1215/00294527-3507386. https://projecteuclid.org/euclid.ndjfl/1459343729


Export citation

References

  • [1] Ash, C. J., and J. F. Knight, Computable Structures and the Hyperarithmetical Hierarchy, vol. 144 of Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 2000.
    Mathematical Reviews (MathSciNet): MR1767842
  • [2] Cole, J. A., and S. G. Simpson, “Mass problems and hyperarithmeticity,” Journal of Mathematical Logic, vol. 7 (2007), pp. 125–43.
    Mathematical Reviews (MathSciNet): MR2423947
    Digital Object Identifier: doi:10.1142/S0219061307000652
  • [3] Feferman, S., “Some applications of the notions of forcing and generic sets,” Fundamenta Mathematicae, vol. 56 (1964/1965), pp. 325–45.
    Mathematical Reviews (MathSciNet): MR176925
  • [4] Fokina, E. B., S.-D. Friedman, and A. Törnquist, “The effective theory of Borel equivalence relations,” Annals of Pure and Applied Logic, vol. 161 (2010), pp. 837–50.
    Mathematical Reviews (MathSciNet): MR2601014
    Digital Object Identifier: doi:10.1016/j.apal.2009.10.002
  • [5] Gerdes, P. M., “Harrington’s solution to McLaughlin’s conjecture and non-uniform self-moduli,” preprint, arXiv:1012.3427v2 [math.LO].
    arXiv: 1012.3427v2
  • [6] Harrington, L. A., “Arithmetically incomparable arithmetic singletons,” handwritten, 28 pp., April 1975.
  • [7] Harrington, L. A., “McLaughlin’s conjecture,” handwritten, 11 pp., September 1976.
  • [8] Hinman, P. G., and T. A. Slaman, “Jump embeddings in the Turing degrees,” Journal of Symbolic Logic, vol. 56 (1991), pp. 563–91.
    Mathematical Reviews (MathSciNet): MR1133085
    Digital Object Identifier: doi:10.2307/2274700
  • [9] Montalbán, A., “There is no ordering on the classes in the generalized high/low hierarchies,” Archive for Mathematical Logic, vol. 45 (2006), pp. 215–31.
    Mathematical Reviews (MathSciNet): MR2209744
    Digital Object Identifier: doi:10.1007/s00153-005-0304-0
  • [10] Odifreddi, P., Classical Recursion Theory, Vol. II, vol. 143 of Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 1999.
    Mathematical Reviews (MathSciNet): MR1718169
  • [11] Rogers, H., Jr., Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967.
    Mathematical Reviews (MathSciNet): MR224462
  • [12] Sacks, G. E., “On a theorem of Lachlan and Martin,” Proceedings of the American Mathematical Society, vol. 18 (1967), pp. 140–41.
    Mathematical Reviews (MathSciNet): MR207558
    Digital Object Identifier: doi:10.1090/S0002-9939-1967-0207558-7
  • [13] Sacks, G. E., Higher Recursion Theory, vol. 2 of Perspectives in Mathematical Logic, Springer, Berlin, 1990.
    Mathematical Reviews (MathSciNet): MR1080970
  • [14] Simpson, M. F., “Arithmetic degrees: Initial segments, $\omega$-REA operators and the $\omega$-jump (recursion theory),” Ph.D. dissertation, Cornell University, Ithaca, N.Y., 1985.
  • [15] Tanaka, H., “A property of arithmetic sets,” Proceedings of the American Mathematical Society, vol. 31 (1972), pp. 521–24.
    Mathematical Reviews (MathSciNet): MR286661
    Digital Object Identifier: doi:10.1090/S0002-9939-1972-0286661-1

Duke University Press

Notre Dame Journal of Formal Logic

New content alerts

Email RSS ToC RSS Article
  • You have access to this content.
  • You have partial access to this content.
  • You do not have access to this content.
Turn Off MathJax

What is MathJax?

More like this

+ See more