Search arXivSearch

arXiv · 2603.07592

Peacock's Principle as a Conservative Strategy

Abstract

The view that Peacock's principle of permanence has been invalidated by Hamilton's introduction of non-commutative algebras has always seemed rather odd, in light of Peacock's favorable reception of quaternions and the endorsement of his principle by Hamilton. But the view is not just odd; it is incorrect. In order to show this, I critically analyze Peacock's attempts to reject possible exceptions to his principle, like the factorial function and an infinite series due to Euler. Then I argue that the principle of permanence is best understood as an expression of a conservative strategy, philosophically grounded in Hume's conception of the laws of reasoning, which advocates their preservation to the furthest extent possible, thus allowing exceptions, i.e., violations of these laws. On this reading, non-commutative multiplication does not invalidate Peacock's principle, if the reasons for violating commutativity outweigh the reasons for its preservation. Finally, I show that Hamilton followed a conservative strategy of precisely this sort when he developed his quaternionic calculus.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Iulian D. Toader. 2026-03-08. Peacock's Principle as a Conservative Strategy. https://doi.org/10.1007/s00407-026-00366-y

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Come for the vibe, stay for the math

This article describes our experiences in mathematical outreach over the past decade. We talk about specific activities, but also general principles that we've learned along the way.

math.HO

From foundations to applications: reverse mathematics and philosophy

Reverse mathematics is a branch of mathematical logic dedicated to determining the minimal set existence principles necessary and sufficient to derive ordinary mathematical theorems about concrete structures like the real line. Since the mid-1970s, reverse mathematics has developed a systematic classification of the strength of theorems in areas of mathematics ranging from real and complex analysis to infinitary combinatorics. This essay will place reverse mathematics in its historical and philosophical context, and reveal its relevance to central issues in the philosophy of mathematics, from the foundational programmes of Hilbert and Brouwer to contemporary debates about realism, determinacy, and applicability of mathematics. In doing so, it will discuss the role of computability theory in measuring the strength of set existence principles, as well as related questions about idealisation when these principles are applied in the physical sciences and in philosophy.

math.HO