Notre Dame Journal of Formal Logic

A Note on Induction, Abstraction, and Dedekind-Finiteness

G. Aldo Antonelli

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

The purpose of this note is to present a simplification of the system of arithmetical axioms given in previous work; specifically, it is shown how the induction principle can in fact be obtained from the remaining axioms, without the need of explicit postulation. The argument might be of more general interest, beyond the specifics of the proposed axiomatization, as it highlights the interaction of the notion of Dedekind-finiteness and the induction principle.

Article information

Source
Notre Dame J. Formal Logic Volume 53, Number 2 (2012), 187-192.

Dates
First available in Project Euclid: 9 May 2012

Permanent link to this document
http://projecteuclid.org/euclid.ndjfl/1336588249

Digital Object Identifier
doi:10.1215/00294527-1715680

Mathematical Reviews number (MathSciNet)
MR2925276

Zentralblatt MATH identifier
06054424

Subjects
Primary: 03A99: None of the above, but in this section

Keywords
arithmetic induction neologicism

Citation

Antonelli, G. Aldo. A Note on Induction, Abstraction, and Dedekind-Finiteness. Notre Dame J. Formal Logic 53 (2012), no. 2, 187--192. doi:10.1215/00294527-1715680. http://projecteuclid.org/euclid.ndjfl/1336588249.


Export citation

References

  • Antonelli, G. A., "The nature and purpose of numbers", The Journal of Philosophy, vol. 107 (2010), pp. 191–212.
  • Antonelli, G. A., "Notions of invariance for abstraction principles", Philosophia Mathematica. Series III, vol. 18 (2010), pp. 276–92.
  • Antonelli, G. A., "Numerical abstraction via the Frege quantifier", Notre Dame Journal of Formal Logic, vol. 51 (2010), pp. 161–79.
  • Boolos, G., "For every ${A}$ there is a ${B}$", Linguistic Inquiry, vol. 12 (1981), pp. 465–66.
  • Floyd, R. W., and R. Beigel, The Language of Machines. An Introduction to Computability and Formal Languages, Computer Science Press, New York, 1994.
  • Linnebo, Ø., "Predicative fragments of Frege arithmetic", Bulletin of Symbolic Logic, vol. 10 (2004), pp. 153–74.