Many mathematical objects arise from equivalence classes and invite implementation as those classes. Set-existence principles that would enable this are incompatible with ZFC's unrestricted aussonderung but there are set theories which admit more instances than does ZF. NF provides equivalence classes for stratified relations only. Church's construction provides equivalence classes for “low” sets, and thus, for example, a set of all ordinals. However, that set has an ordinal in turn which is not a member of the set constructed; so no (...) set of all ordinals is obtained thereby. This “recurrence problem” is discussed. (shrink)

Many mathematical objects arise from equivalence classes and invite implementation as those classes. Set-existence principles that would enable this are incompatible with ZFC's unrestricted _aussonderung_ but there are set theories which admit more instances than does ZF. NF provides equivalence classes for stratified relations only. Church's construction provides equivalence classes for "low" sets, and thus, for example, a set of all ordinals. However, that set has an ordinal in turn which is not a member of the set constructed; so no (...) set of _all_ ordinals is obtained thereby. This "recurrence problem" is discussed. (shrink)

The purpose of this article is to assess the prospects for a Scottish neo-logicist foundation for a set theory. We show how to reformulate a key aspect of our set theory as a neo-logicist abstraction principle. That puts the enterprise on the neo-logicist map, and allows us to assess its prospects, both as a mathematical theory in its own right and in terms of the foundational role that has been advertised for set theory. On the positive side, we show that (...) our abstraction based theory can be modified to yield much of ordinary mathematics, indeed everything needed to recapture all branches of mathematics short of set theory itself. However, our conclusions are mostly negative. The theory will fall far short of the power of ordinary Zermelo-Fraenkel set theory. It is consistent that our set theory has models that are relatively small, smaller than the first cardinal with an uncountable index. More important, there is a strong tension between the idea that the iterative hierarchy is somehow ineffable, or indefinitely extensible, and the neo-logicist theme of capturing mathematical theories with abstraction principles. (shrink)

The essays can be seen as addressing Tarski's seminal treatment of four basic questions about logical consequence. (1) How are we to understand truth, one of ...

The paper formulates and proves a strengthening of ‘Frege’s Theorem’, which states that axioms for second-order arithmetic are derivable in second-order logic from Hume’s Principle, which itself says that the number of Fs is the same as the number ofGs just in case the Fs and Gs are equinumerous. The improvement consists in restricting this claim to finite concepts, so that nothing is claimed about the circumstances under which infinite concepts have the same number. ‘Finite Hume’s Principle’ also suffices for (...) the derivation of axioms for arithmetic and, indeed, is equivalent to a version of them, in the presence of Frege’s definitions of the primitive expressions of the language of arithmetic. The philosophical significance of this result is also discussed. (shrink)

A brief, non-technical introduction to technical and philosophical aspects of Frege's philosophy of arithmetic. The exposition focuses on Frege's Theorem, which states that the axioms of arithmetic are provable, in second-order logic, from a single non-logical axiom, "Hume's Principle", which itself is: The number of Fs is the same as the number of Gs if, and only if, the Fs and Gs are in one-one correspondence.

Kit Fine develops a Fregean theory of abstraction, and suggests that it may yield a new philosophical foundation for mathematics, one that can account for both our reference to various mathematical objects and our knowledge of various mathematical truths. The Limits ofion breaks new ground both technically and philosophically.

A neologicist set theory based on an abstraction principle (NewerV) codifying the iterative conception of set is investigated, and its strength is compared to Boolos's NewV. The new principle, unlike NewV, fails to imply the axiom of replacement, but does secure powerset. Like NewV, however, it also fails to entail the axiom of infinity. A set theory based on the conjunction of these two principles is then examined. It turns out that this set theory, supplemented by a principle stating that (...) there are infinitely many nonsets, captures all (or enough) of standard second-order ZFC. Issues pertaining to the axiom of foundation are also investigated, and I conclude by arguing that this treatment provides the neologicist with the most viable reconstruction of set theory he is likely to obtain. (shrink)

One of the main problems plaguing neo-logicism is the Bad Company challenge: the need for a well-motivated account of which abstraction principles provide legitimate definitions of mathematical concepts. In this article a solution to the Bad Company challenge is provided, based on the idea that definitions ought to be conservative. Although the standard formulation of conservativeness is not sufficient for acceptability, since there are conservative but pairwise incompatible abstraction principles, a stronger conservativeness condition is sufficient: that the class of acceptable (...) abstraction principles be strictly logically symmetrically class conservative . The article concludes with an examination of which classes of abstraction principles meet this criteria. (shrink)

A co-authored article with Roy T. Cook forthcoming in a special edition on the Caesar Problem of the journal Dialectica. We argue against the appeal to equivalence classes in resolving the Caesar Problem.

This paper contains a close analysis of Frege's proofs of the axioms of arithmetic §§70-83 of Die Grundlagen, with special attention to the proof of the existence of successors in §§82-83. Reluctantly and hesitantly, we come to the conclusion that Frege was at least somewhat confused in those two sections and that he cannot be said to have outlined, or even to have intended, any correct proof there. The proof he sketches is in many ways similar to that given in (...) Grundgesetze der Arithmetik, but fidelity to what Frege wrote in Die Grundlagen and in Grundgesetze requires us to reject the charitable suggestion that it was this (beautiful) proof that he had in mind in §§82-83. (shrink)

The logical status of abstraction principles, and especially Hume’s Principle, has been long debated, but the best currently availeble tool for explicating a notion’s logical character—permutation invariance—has not received a lot of attention in this debate. This paper aims to fill this gap. After characterizing abstraction principles as particular mappings from the subsets of a domain into that domain and exploring some of their properties, the paper introduces several distinct notions of permutation invariance for such principles, assessing the philosophical significance (...) of each. (shrink)

This collection, nearly all chosen by Boolos himself shortly before his death, includes thirty papers on set theory, second-order logic, and plural quantifiers; ...

In Frege's Conception of Logic Patricia A. Blanchette explores the relationship between Gottlob Frege's understanding of conceptual analysis and his understanding of logic.