Abstract

This paper uses neo-Fregean-style abstraction principles to develop the integers from the natural numbers (assuming Hume’s principle), the rational numbers from the integers, and the real numbers from the rationals. The first two are first-order abstractions that treat pairs of numbers: (DIF) INT(a,b)=INT(c,d) ≡ (a+d)=(b+c). (QUOT) Q(m,n)=Q(p,q) ≡ (n=0 & q=0) ∨ (n≠0 & q≠0 & m⋅q=n⋅p). The development of the real numbers is an adaption of the Dedekind program involving “cuts” of rational numbers. Let P be a property (of rational numbers) and r a rational number. Say that r is an upper bound of P, written P≤r, if for any rational number s, if Ps then either s<r or s=r. In other words, P≤r if r is greater than or equal to any rational number that P applies to. Consider the Cut Abstraction Principle: (CP) ∀P∀Q(C(P)=C(Q) ≡ ∀r(P≤r ≡ Q≤r)). In other words, the cut of P is identical to the cut of Q if and only if P and Q share all of their upper bounds. The axioms of second-order real analysis can be derived from (CP), just as the axioms of second-order Peano arithmetic can be derived from Hume’s principle. The paper raises some of the philosophical issues connected with the neo-Fregean program, using the above abstraction principles as case studies.