A Natural History of Mathematics: George Peacock and the Making of English Algebra

Isis 104 (2):278-302 (2013)
  Copy   BIBTEX

Abstract

ABSTRACT In a series of papers read to the Cambridge Philosophical Society through the 1820s, the Cambridge mathematician George Peacock laid the foundation for a natural history of arithmetic that would tell a story of human progress from counting to modern arithmetic. The trajectory of that history, Peacock argued, established algebraic analysis as a form of universal reasoning that used empirically warranted operations of mind to think with symbols on paper. The science of counting would suggest arithmetic, arithmetic would suggest arithmetical algebra, and, finally, arithmetical algebra would suggest symbolic algebra. This philosophy of suggestion provided the foundation for Peacock's “principle of equivalent forms,” which justified the practice of nineteenth-century English symbolic algebra. Peacock's philosophy of suggestion owed a considerable debt to the early Cambridge Philosophical Society culture of natural history. The aim of this essay is to show how that culture of natural history was constitutively significant to the practice of nineteenth-century English algebra.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,227

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

19th century logic between philosophy and mathematics.Volker Peckhaus - 1999 - Bulletin of Symbolic Logic 5 (4):433-450.
MV and Heyting Effect Algebras.D. J. Foulis - 2000 - Foundations of Physics 30 (10):1687-1706.
Algebra in the scribal school—Schools in old Babylonia algebra?Jens Høyrup - 1993 - NTM Zeitschrift für Geschichte der Wissenschaften, Technik und Medizin 1 (1):201-218.
Kant on arithmetic, algebra, and the theory of proportions.Daniel Sutherland - 2006 - Journal of the History of Philosophy 44 (4):533-558.
Approximation Logic and Strong Bunge Algebra.Michiro Kondo - 1995 - Notre Dame Journal of Formal Logic 36 (4):595-605.
Randomness, computability and algebraic specifications.Bakhadyr Khoussainov - 1998 - Annals of Pure and Applied Logic 91 (1):1-15.

Analytics

Added to PP
2015-02-05

Downloads
19 (#803,294)

6 months
4 (#798,951)

Historical graph of downloads
How can I increase my downloads?