The systems Kα of transfinite cumulative types up to α are extended to systems K∞α that include a natural infinitary inference rule, the so-called limit rule. For countable α a semantic completeness theorem for K∞α is proved by the method of reduction trees, and it is shown that every model of K∞α is equivalent to a cumulative hierarchy of sets. This is used to show that several axiomatic first-order set theories can be interpreted in K∞α, for suitable α.

The twentieth century has witnessed an unprecedented 'crisis in the foundations of mathematics', featuring a world-famous paradox (Russell's Paradox), a challenge to 'classical' mathematics from a world-famous mathematician (the 'mathematical intuitionism' of Brouwer), a new foundational school (Hilbert's Formalism), and the profound incompleteness results of Kurt Gödel. In the same period, the cross-fertilization of mathematics and philosophy resulted in a new sort of 'mathematical philosophy', associated most notably (but in different ways) with Bertrand Russell, W. V. Quine, and Gödel himself, (...) and which remains at the focus of Anglo-Saxon philosophical discussion. The present collection brings together in a convenient form the seminal articles in the philosophy of mathematics by these and other major thinkers. It is a substantially revised version of the edition first published in 1964 and includes a revised bibliography. The volume will be welcomed as a major work of reference at this level in the field. (shrink)

On reading the last sentence, did you interpret me as saying falsely that everything — everything in the entire universe — was packed into my carry-on baggage? Probably not. In ordinary language, ‘everything’ and other quantifiers (‘something’, ‘nothing’, ‘every dog’, ...) often carry a tacit restriction to a domain of contextually relevant objects, such as the things that I need to take with me on my journey. Thus a sentence of the form ‘Everything Fs’ is true as uttered in a (...) context C if and only if everything that is relevant in C satisfies the predicate ‘F’; ‘everything’ ranges just over the contextually relevant things. Such generality is restricted in a context-relative way. (shrink)

I ON THE PRIMITIVE TERM OF LOGISTICf IN this article I propose to establish a theorem belonging to logistic concerning some connexions, not widely known, ...

The central contention of this book is that second-order logic has a central role to play in laying the foundations of mathematics. In order to develop the argument fully, the author presents a detailed description of higher-order logic, including a comprehensive discussion of its semantics. He goes on to demonstrate the prevalence of second-order concepts in mathematics and the extent to which mathematical ideas can be formulated in higher-order logic. He also shows how first-order languages are often insufficient to codify (...) many concepts in contemporary mathematics, and thus that both first- and higher-order logics are needed to fully reflect current work. Throughout, the emphasis is on discussing the associated philosophical and historical issues and the implications they have for foundational studies. For the most part, the author assumes little more than a familiarity with logic comparable to that provided in a beginning graduate course which includes the incompleteness of arithmetic and the Lowenheim-Skolem theorems. All those concerned with the foundations of mathematics will find this a thought-provoking discussion of some of the central issues in the field today. (shrink)

There is little doubt that a second-order axiomatization of Zermelo-Fraenkel set theory plus the axiom of choice (ZFC) is desirable. One advantage of such an axiomatization is that it permits us to express the principles underlying the first-order schemata of separation and replacement. Another is its almost-categoricity: M is a model of second-order ZFC if and only if it is isomorphic to a model of the form Vκ, ∈ ∩ (Vκ × Vκ) , for κ a strongly inaccessible ordinal.

This massive two-volume reference presents a comprehensive selection of the most important works on the foundations of mathematics. While the volumes include important forerunners like Berkeley, MacLaurin, and D'Alembert, as well as such followers as Hilbert and Bourbaki, their emphasis is on the mathematical and philosophical developments of the nineteenth century. Besides reproducing reliable English translations of classics works by Bolzano, Riemann, Hamilton, Dedekind, and Poincare, William Ewald also includes selections from Gauss, Cantor, Kronecker, and Zermelo, all translated here for (...) the first time. (shrink)

I have two main objectives. The first is to get a better understanding of what is at issue between friends and foes of higher-order quantification, and of what it would mean to extend a Boolos-style treatment of second-order quantification to third- and higherorder quantification. The second objective is to argue that in the presence of absolutely general quantification, proper semantic theorizing is essentially unstable: it is impossible to provide a suitably general semantics for a given language in a language of (...) the same logical type. I claim that this leads to a trilemma: one must choose between giving up absolutely general quantification, settling for the view that adequate semantic theorizing about certain languages is essentially beyond our reach, and countenancing an open-ended hierarchy of languages of ever ascending logical type. I conclude by suggesting that the hierarchy may be the least unattractive of the options on the table. (shrink)

This paper criticizes George Boolos's famous use of plural quantification to argue that monadic second-order logic is pure logic. I deny that plural quantification qualifies as pure logic and express serious misgivings about its alleged ontological innocence. My argument is based on an examination of what is involved in our understanding of the impredicative plural comprehension schema.

Mathematical realism is the doctrine that mathematical objects really exist, that mathematical statements are either determinately true or determinately false, and that the accepted mathematical axioms are predominantly true. A realist understanding of set theory has it that when the sentences of the language of set theory are understood in their standard meaning, each sentence has a determinate truth value, so that there is a fact of the matter whether the cardinality of the continuum is א2 or whether there are (...) measurable cardinals, whether or not those facts are knowable by us. (shrink)

where ‘aa’ is a plural term, and ‘F’ a plural predicate. Following George Boolos (1984) and others, many philosophers and logicians also think that plural expressions should be analysed as not introducing any new ontological commitments to some sort of ‘plural entities’, but rather as involving a new form of reference to objects to which we are already committed (for an overview and further details, see Linnebo 2004). For instance, the plural term ‘aa’ refers to Alice, Bob and Charlie simultaneously, (...) and the plural predicate ‘F’ is true of some things just in case these things cooperate. A natural question that arises is whether the step from the singular to the plural can be iterated. Are there terms that stand to ordinary plural terms the way ordinary plural terms stand to singular terms? Let’s call such terms superplural. A superplural term would thus, loosely speaking, refer to several ‘pluralities’ at once, much as an ordinary plural term refers to several objects at once.1 Further, let’s call a predicate superplural if it can be predicated of superplural terms. It is reasonably straightforward to devise a formal logic of superplural terms, superplural predicates, and even superplural quantifiers (see Rayo 2006). But does this formal logic reflect any features of natural languages? In particular, does ordinary English contain superplural terms and predicates? The purpose of this article is to address these questions. We examine some earlier arguments for the existence of superplural expressions in English and find them to be either.. (shrink)

Say that some things form a set just in case there is a set whose members are precisely the things in question. For instance, all the inhabitants of New York form a set. So do all the stars in the universe. And so do all the natural numbers. Under what conditions do some things form a set?

What is the nature of mathematical knowledge? Is it anything like scientific knowledge or is it sui generis? How do we acquire it? Should we believe what mathematicians themselves tell us about it? Are mathematical concepts innate or acquired? Eight new essays offer answers to these and many other questions.

This influential 1888 publication explained the real numbers, and their construction and properties, from first principles.