Online research in philosophy

The neo-Fregean account of arithmetical knowledge is centered around the abstraction principle known as Hume’s Principle: for any concepts X and Y , the number of X ’s is the same as the number of Y ’s just in case there is a 1–1 correspondence between X and Y . The Caesar Problem, originally raised by Frege in §56 of Die Grundlagen der Arithmetik , emerges in the context of the neo-Fregean programme, because, though Hume’s Principle provides a criterion of identity for objects falling under the concept of Number–namely, 1–1 correspondence—the principle fails to deliver a criterion of application. That is, it fails to deliver a criterion that will tell us which objects fall under the concept Number, and so, leaves unanswered the question whether Caesar could be a number. Hale and Wright have recently offered a neo-Fregean solution to this problem. The solution appeals to the notion of a categorical sortal. This paper offers a reconstruction of their solution, which has the advantage over Hale and Wright’s original proposal of making clear what the structure of the background ontology is. In addition, it is shown that the Caesar Problem can be solved in a framework more minimal than that of Hale and Wright, viz . one that dispenses with categorical sortals. The paper ends by discussing an objection to the proposed neo-Fregean solutions, based on the idea that Leibniz’s Law gives a universal criterion of identity. This is an idea that Hale and Wright reject. However, it is shown that a solution very much in keeping with their own proposal is available, even if it is granted that Leibniz’s Law provides a universal criterion of identity.

Neo-Fregean logicism attempts to base mathematics on abstraction principles. Since not all abstraction principles are acceptable, the neo-Fregeans need an account of which ones are. One of the most promising accounts is in terms of the notion of stability; roughly, that an abstraction principle is acceptable just in case it is satisfiable in all domains of sufficiently large cardinality. We present two counterexamples to stability as a sufficient condition for acceptability and argue that these counterexamples can be avoided only by major departures from the existing neo-Fregean programme.

Frege's logicism consists of two theses: (1) the truths of arithmetic are truths of logic; (2) the natural numbers are objects. In this paper I pose the question: what conception of logic is required to defend these theses? I hold that there exists an appropriate and natural conception of logic in virtue of which Hume's principle is a logical truth. Hume's principle, which states that the number of Fs is the number of Gs iff the concepts F and G are equinumerous is the central plank in the neo-logicist argument for (1) and (2). I defend this position against two objections (a) Hume's principle canot be both a logical truth as required by (1) and also have the ontological import required by (2); and (b) the use of Hume's principle by the logicist is in effect an ontological proof of a kind which is not valid.

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.

Hale proposes a neo-logicist definition of real numbers by abstraction as ratios defined on a complete ordered domain of quantities (magnitudes). I argue that Hale's definition faces insuperable epistemological and ontological difficulties. On the epistemological side, Hale is committed to an explanation of measurement applications of reals which conflicts with several theorems in measurement theory. On the ontological side, Hale commits himself to the necessary and a priori existence of at least one complete ordered domain of quantities, which is extremely implausible because science treats the logical structure of quantities as subject to experimentally and theoretically motivated refinements and revisions.

In this short letter to Ed Zalta we raise a number of issues with regards to his version of Neo-Logicism. The letter is, in parts, based on a longer manuscript entitled “What Neo-Logicism could not be” which is in preparation. A response by Ed Zalta to our letter can be found on his website: http://mally.stanford.edu/publications.html (entry C3).

On the neo-Fregean approach to the foundations of mathematics, elementary arithmetic is analytic in the sense that the addition of a principle wliich may be held to IMJ explanatory of the concept of cardinal number to a suitable second-order logical basis suffices for the derivation of its basic laws. This principle, now commonly called Hume's principle, is an example of a Fregean abstraction principle. In this paper, I assume the correctness of the neo-Fregean position on elementary aritlunetic and seek to explain one way in which it may be extended to encompass the theory of real numbers, introducing the reals, by means of suitable further abstraction principles, as ratios of quantities.

Frege's logicism consists of two theses: (1) the truths of arithmetic are truths of logic; (2) the natural numbers are objects. In this paper I pose the question: what conception of logic is required to defend these theses? I hold that there exists an appropriate and natural conception of logic in virtue of which Hume's principle is a logical truth. Hume's principle, which states that the number of Fs is the number of Gs iff the concepts F and G are equinumerous is the central plank in the neo-logicist argument for (1) and (2). I defend this position against two objections (a) Hume's principle canot be both a logical truth as required by (1) and also have the ontological import required by (2); and (b) the use of Hume's principle by the logicist is in effect an ontological proof of a kind which is not valid.

Stewart Shapiro and Alan Weir have argued that a crucial part of the demonstration of Frege's Theorem (specifically, that Hume's Principle implies that there are infinitely many objects) fails if the Neo-logicist cannot assume the existence of the empty property, i.e., is restricted to so-called Aristotelian Logic. Nevertheless, even in the context of Aristotelian Logic, Hume's Principle implies much of the content of Peano Arithmetic. In addition, their results do not constitute an objection to Neo-logicism so much as a clarification regarding the view of logic that the Neo-logicist must take.

This paper introduces and evaluates two contemporary approaches of neo-logicism. Our aim is to highlight the differences between these two neo-logicist programmes and clarify what each projects attempts to achieve. To this end, we first introduce the programme of the Scottish school – as defended by Bob Hale and Crispin Wright1 which we believe to be a..