What counts as an intuitively plausible set theoretic content (notion, axiom or theorem) has been a matter of much debate in contemporary philosophy of mathematics. In this paper I develop a critical appraisal of the issue. I analyze first R. B. Jensen's positions on the epistemic status of the axiom of constructibility. I then formulate and discuss a view of intuitiveness in set theory that assumes it to hinge basically on mathematical success. At the same time, I present accounts of (...) set theoretic axioms and theorems formulated in non-strictly mathematical terms, e.g., by appealing to the iterative concept of set and/or to overall methodological principles, like unify and maximize, and investigate the relation of the latter to success in mathematics. (shrink)

The Hyperuniverse Program is a new approach to set-theoretic truth which is based on justifiable principles and leads to the resolution of many questions independent from ZFC. The purpose of this paper is to present this program, to illustrate its mathematical content and implications, and to discuss its philosophical assumptions.

The philosophy of mathematics plays an important role in analytic philosophy, both as a subject of inquiry in its own right, and as an important landmark in the broader philosophical landscape. Mathematical knowledge has long been regarded as a paradigm of human knowledge with truths that are both necessary and certain, so giving an account of mathematical knowledge is an important part of epistemology. Mathematical objects like numbers and sets are archetypical examples of abstracta, since we treat such objects in (...) our discourse as though they are independent of time and space; finding a place for such objects in a broader framework of thought is a central task of ontology, or metaphysics. The rigor and precision of mathematical language depends on the fact that it is based on a limited vocabulary and very structured grammar, and semantic accounts of mathematical discourse often serve as a starting point for the philosophy of language. Although mathematical thought has exhibited a strong degree of stability through history, the practice has also evolved over time, and some developments have evoked controversy and debate; clarifying the basic goals of the practice and the methods that are appropriate to it is therefore an important foundational and methodological task, locating the philosophy of mathematics within the broader philosophy of science. (shrink)

Most philosophers of mathematics try to show either that the sort of knowledge mathematicians have is similar to the sort of knowledge specialists in the empirical sciences have or that the kind of knowledge mathematicians have, although apparently about objects such as numbers, sets, and so on, isn't really about those sorts of things as well. Jody Azzouni argues that mathematical knowledge really is a special kind of knowledge with its own special means of gathering evidence. He analyses the linguistic (...) pitfalls and misperceptions philosophers in this field are often prone to, and explores the misapplications of epistemic principles from the empirical sciences to the exact sciences. What emerges is a picture of mathematics both sensitive to mathematical practice, and to the ontological and epistemological issues that concern philosophers. (shrink)

What is so special and mysterious about the Continuum, this ancient, always topical, and alongside the concept of integers, most intuitively transparent and omnipresent conceptual and formal medium for mathematical constructions and the battle field of mathematical inquiries ? And why it resists the century long siege by best mathematical minds of all times committed to penetrate once and for all its set-theoretical enigma ? -/- The double-edged purpose of the present study is to save from the transfinite deadlock of (...) higher set theory the jewel of mathematical Continuum -- this genuine, even if mostly forgotten today raison d'etre of all set-theoretical enterprises to Infinity and beyond, from Georg Cantor to W. Hugh Woodin to Buzz Lightyear, by simultaneously exhibiting the limits and pitfalls of all old and new reductionist foundational approaches to mathematical truth: be it Cantor's or post-Cantorian Idealism, Brouwer's or post-Brouwerian Constructivism, Hilbert's or post-Hilbertian Formalism, Goedel's or post-Goedelian Platonism. -/- In the spirit of Zeno's paradoxes, but with the enormous historical advantage of hindsight, we claim that Cantor's set-theoretical methodology, powerful and reach in proof-theoretic and similar applications as it might be, is inherently limited by its epistemological framework of transfinite local causality, and neither can be held accountable for the properties of the Continuum already acquired through geometrical, analytical, and arithmetical studies, nor can it be used for an adequate, conceptually sensible, operationally workable, and axiomatically sustainable re-creation of the Continuum. -/- From a strictly mathematical point of view, this intrinsic limitation of the constative and explicative power of higher set theory finds its explanation in the identified in this study ultimate phenomenological obstacle to Cantor's transfinite construction, similar to topological obstacles in homotopy theory and theoretical physics: the entanglement capacity of the mathematical Continuum. (shrink)

The main aim is to extend the range of logics which solve the set-theoretic paradoxes, over and above what was achieved by earlier work in the area. In doing this, the paper also provides a link between metacomplete logics and those that solve the paradoxes, by finally establishing that all M1-metacomplete logics can be used as a basis for naive set theory. In doing so, we manage to reach logics that are very close in their axiomatization to that of the (...) logic R of relevant implication. A further aim is the use of metavaluations in a new context, expanding the range of application of this novel technique, already used in the context of negation and arithmetic, thus providing an alternative to traditional model theoretic approaches. (shrink)

A new axiomatization of set theory, to be called Bernays-Boolos set theory, is introduced. Its background logic is the plural logic of Boolos, and its only positive set-theoretic existence axiom is a reflection principle of Bernays. It is a very simple system of axioms sufficient to obtain the usual axioms of ZFC, plus some large cardinals, and to reduce every question of plural logic to a question of set theory.

Thanks to all the people who responded to my enquiry about the status of the Continuum Hypothesis. This is a really fascinating subject, which I could waste far too much time on. The following is a summary of some aspects of the feeling I got for the problems. This will be old hat to set theorists, and no doubt there are a couple of embarrassing misunderstandings, but it might be of some interest to non professionals.

When a quantified premise such as: Everyone loves anyone who loves someone, occurs with a premise such as: Anne loves Beth, it follows immediately that everyone loves Anne. It also follows that Carol loves Diane, where these two individuals are in the domain of discourse. According to the theory of mental models, this inference requires the quantified premise to be used again to update a model of specific individuals. The paper reports four experiments examining such iterative inferences. Experiment 1 confirmed (...) that they are harder than immediate inferences. Experiment 2 extended the finding to negative inferences, i.e., granted that Anne does not love Beth, it follows from the quantified premise that Carol does not love Diane. Experiment 3 established that intermediate steps referring to specific individuals are accepted more readily than intermediate steps referring to quantified variables. Experiment 4 showed that the participants' written justifications corroborated the model theory. (shrink)

It is sometimes suggested that impure sets are spatially co-located with their members (and hence are located in space). Sets, however, are in important respects like numbers. In particular, sets are connected to concepts in much the same manner as numbers are connected to concepts—in both cases, they are fundamentally abstracts of (or corresponding to) concepts. This parallel between the structure of sets and the structure of numbers suggests that the metaphysics of sets and the metaphysics of numbers should parallel (...) each other in relevant ways. This entails, in turn, that impure sets are not co-located with their members (nor are they located in space). (shrink)

This paper treats the situation where a single mathematical construction satisfies a multitude of interesting mathematical properties. The examples treated are all infinitely large entities. The clustering of properties is termed ‘niceness’ by the mathematician Michiel Hazewinkel, a concept we compare to the ‘robustness’ described by the philosopher of science William Wimsatt. In the final part of the paper, we bring our findings to bear on the question of realism which concerns not whether mathematical entities exist as abstract objects, but (...) rather whether the choice of our concepts is forced upon us. (shrink)

Constructive and intuitionistic Zermelo-Fraenkel set theories are axiomatic theories of sets in the style of Zermelo-Fraenkel set theory (ZF) which are based on intuitionistic logic. They were introduced in the 1970's and they represent a formal context within which to codify mathematics based on intuitionistic logic. They are formulated on the basis of the standard first order language of Zermelo-Fraenkel set theory and make no direct use of inherently constructive ideas. In working in constructive and intuitionistic ZF we can thus (...) to some extent rely on our familiarity with ZF and its heuristics. -/- Notwithstanding the similarities with classical set theory, the concepts of set defined by constructive and intuitionistic set theories differ considerably from that of the classical tradition; they also differ from each other. The techniques utilised to work within them, as well as to obtain metamathematical results about them, also diverge in some respects from the classical tradition because of their commitment to intuitionistic logic. In fact, as is common in intuitionistic settings, a plethora of semantic and proof-theoretic methods are available for the study of constructive and intuitionistic set theories. -/- The entry introduces the main features of Constructive and Intuitionistic ZF and offers links to the relevant bibliography. (shrink)

Dedekind used to refer to Riemann as his main model concerning mathematical methodology, particularly regarding the use of abstract notions as a basis for mathematical theories. So, in passages written in 1876 and 1895 he compared his approach to ideal theory with Riemann’s theory of complex functions. In this paper, I try to make sense of those declarations, showing the role of abstract notions in Riemann’s function theory, its influence on Dedekind, and the importance of the methodological principle of avoiding (...) ‘forms of representation’ in shaping ideal theory. In order to emphasize the abstract viewpoint of Riemann and Dedekind, I compare their work with that of their great german contemporaries, Weierstrass and Kronecker; so, an influential ‘Göttingen group’ is confronted with the ‘Berlin school’ of mathematics. Some light is also thrown on the relation between Riemann and Dedekind, particularly with respect to Dedekind’s interest on Riemann’s ideas --in function theory, geometry and topology--, beginning in the 1850s and through later works. The abstract approach of the ‘Göttingen group’ was determinant for the turn to abstract mathematics in our century, and the direct influence of Riemann on Dedekind shows how this approach developed. (shrink)

Towards the end of his 1930 paper on boundary numbers and domains of sets Zermelo briefly discusses the questions of consistency and of the existence of an unbounded sequence of strongly inaccessible cardinals, deferring a detailed discussion to a later paper which never appeared. In a report to the Emergency Community of German Science from December 1930 about investigations in progress he mentions that some of the intended extensions of these topics had been worked out and were nearly ready for (...) publication. Using manuscripts from his Nachlass, we exhibit essential features of these extensions. (shrink)

The purpose of this book is to introduce the basic ideas of mathematical proof to students embarking on university mathematics. The emphasis is on helping the reader in understanding and constructing proofs and writing clear mathematics. This is achieved by exploring set theory, combinatorics and number theory, topics which include many fundamental ideas which are part of the tool kit of any mathematician. This material illustrates how familiar ideas can be formulated rigorously, provides examples demonstrating a wide range of basic (...) methods of proof, and includes some of the classic proofs. The book presents mathematics as a continually developing subject. Material meeting the needs of readers from a wide range of backgrounds is included. Over 250 problems include questions to interest and challenge the most able student as well as plenty of routine exercises to help familiarize the reader with the basic ideas. (shrink)

The purpose of this article is to explain why I believe that the Continuum Hypothesis (CH) is not a definite mathematical problem. My reason for that is that the concept of arbitrary set essential to its formulation is vague or underdetermined and there is no way to sharpen it without violating what it is supposed to be about. In addition, there is considerable circumstantial evidence to support the view that CH is not definite.

Set theory deals with the most fundamental existence questions in mathematics—questions which affect other areas of mathematics, from the real numbers to structures of all kinds, but which are posed as dealing with the existence of sets. Especially noteworthy are principles establishing the existence of some infinite sets, the so-called “arbitrary sets.” This paper is devoted to an analysis of the motivating goal of studying arbitrary sets, usually referred to under the labels of quasi-combinatorialism or combinatorial maximality. After explaining what (...) is meant by definability and by “arbitrariness,” a first historical part discusses the strong motives why set theory was conceived as a theory of arbitrary sets, emphasizing connections with analysis and particularly with the continuum of real numbers. Judged from this perspective, the axiom of choice stands out as a most central and natural set-theoretic principle (in the sense of quasi-combinatorialism). A second part starts by considering the potential mismatch between the formal systems of mathematics and their motivating conceptions, and proceeds to offer an elementary discussion of how far the Zermelo—Fraenkel system goes in laying out principles that capture the idea of “arbitrary sets”. We argue that the theory is rather poor in this respect. (shrink)

Nonstandard set theory is an attempt to generalise nonstandard analysis to cover the whole of classical mathematics. Existing versions (Nelson, Hrbáček, Kawai) are unsatisfactory in that the unlimited idealisation principle conflicts with the wish to have a full theory of external sets. I re-analyse the underlying requirements of nonstandard set theory and give a new formal system, stratified nonstandard set theory, which seems to meet them better than the other versions.

Either from concrete examples such as tomatoes on a plate, an egg carton full of eggs and so on, or simply because of the braces notation, we come to have some intuitions about the sorts of things sets might be. (See Maddy 1990.) First we tend to think of a set of particulars as itself a particular thing.. Second, even after the distinction between settheory and mereology has been carefully explained we tend to think of the members of a set (...) as in some sense parts. And third we tend to think that there is something represented by the braces. Now if there were experts who got their intuitions from elsewhere then we could discard these rather crude ideas about egg cartons and so on. But I suspect the intuitions of experts are, just like those of the rest of us, based on notation and simple examples. (shrink)

In general little thought is given to the general question of how to implement mathematical objects in set theory. It is clear that—at various times in the past—people have gone to considerable lengths to devise implementations with nice properties. There is a litera- ture on the evolution of the Wiener-Kuratowski ordered pair, and a discussion by Quine of the merits of an ordered-pair implemen- tation that makes every set an ordered pair. The implementation of ordinals as Von Neumann ordinals is (...) so attractive that it is uni- versally used in all set theories which have enough replacement to prove Mostowski’s collapse lemma. I have frequently complained in the past about the widespread habit of referring to implementations of pairs (ordinals etc) as definitions of pairs (etc). My point here is a different one: generally little attention has been paid to the question of what makes an implementation a good implementation. In most cases of interest the merits of the candidates are uncontroversial. What I want to examine here is an example where there are com- peting implementations for ordered pairs, and—although it is clear to the cognoscenti and also (with a bit of arm-waving) plausible to the logician in the street that some of the impossible candidates are impossible, nobody has ever given a satisfactory explanation of why this is so. (shrink)

In 1942 Haskell B. Curry presented what is now called Curry's paradox which can be found in a logic independently of its stand on negation. In recent years there has been a revitalised interest in non-classical solutions to the semantic paradoxes. In this article the non-classical resolution of Curry’s Paradox and Shaw-Kwei' sparadox without rejection any contraction postulate is proposed. In additional relevant paraconsistent logic C ̌_n^#,1≤n<ω, in fact,provide an effective way of circumventing triviality of da Costa’s paraconsistent Set Theories〖NF〗n^C.

Each of these theorems and concepts arose from very specific considerations of great general interest in the foundations of mathematics (f.o.m.). They each serve well defined purposes in f.o.m. Naturally, the preferred way to formulate them for mathe-matical logicians is in terms that are close to their roots in f.o.m.

This paper was referred to in the Introduction in our paper [Fr97a], “The Axiomatization of Set Theory by Separation, Reducibility, and Comprehension.” In [Fr97a], all systems considered used the axiom of Extensionality. This is appropriate in a set theoretic context.

This paper explores the metaphysical roots of Cantor’s conception of absolute infinity in order to shed some light on two basic issues that also affect the mathematical theory of sets: the viability of Cantor’s distinction between sets and inconsistent multiplicities, and the intrinsic justification of strong axioms of infinity that are studied in contemporary set theory.

In explaining his concept of set Cantor intimates a connection with the metaphysical scheme put forward in Plato’s Philebus to determine the place of pleasure. We argue that these determinations capture key ideas of Cantorian set theory and, moreover, extend to intuitions which continue to play a central role in the modern mathematics of infinity.

The Axiom of Projective Determinacy implies the existence of a universal $\utilde{\Pi}^{1}_{n}\setminus\utilde{\Delta}^{1}_{n}$ set for every $n \geq 1$. Assuming $\text{\upshape MA}(\aleph_{1})+\aleph_{1}=\aleph_{1}^{\mathbb{L}}$ there exists a universal $\utilde{\Pi}^{1}_{1}\setminus\utilde{\Delta}^{1}_{1}$ set. In ZFC there is a universal $\utilde{\Pi}^{0}_{\alpha}\setminus\utilde{\Delta}^{0}_{\alpha}$ set for every $\alpha$.

We present mathematics from a foundational perspective as a hierarchy in which each tier consists of a language, a logic, and a mathematical theory. Each tier in the hierarchy subsumes all preceding tiers in the sense that its language, logic, and mathematical theory generalize all preceding languages, logics, and mathematical theories. Starting from the root tier, the mathematical theories in this hierarchy are: combinatory logic restricted to the identity I, combinatory logic, ZFC set theory, constructive type theory, and category theory. (...) The languages of the first four tiers correspond to the languages of the Chomsky hierarchy: in combinatory logic Ix = x gives rise to a regular language; the language generated by S, K in combinatory logic is context-free; first-order logic is context-sensitive; and the typed lambda calculus of type theory is recursively enumerable. The logic of each tier can be characterized in terms of the cardinality of the set of its truth values: combinatory logic restricted to I has 0 truth values, while combinatory logic has 1, first-order logic 2, constructive type theory 3, and categeory theory omega_0. We conjecture that the cardinality of objects whose existence can be established in each tier is bounded; for example, combinatory logic is bounded in this sense by omega_0 and ZFC set theory by the least inaccessible cardinal. We also show that classical recursion theory presents a framework for generating the above hierarchy in terms of the initial functions zero, projection, and successor followed by composition and m-recursion, starting with the zero function I in combinatory logic This paper begins with a theory of glossogenesis, i.e. a theory of the origin of language, since this theory shows that natural language has deep connections to category theory and since it was through these connections that the last tier and ultimately the whole hierarchy were discovered. The discussion covers implications of the hierarchy for mathematics, physics, cosmology, theology, linguistics, extraterrestrial communication, and artificial intelligence. (shrink)

In philosophical logic, a certain family of model constructions has received particular attention. Prominent examples are the cumulative hierarchy of well-founded sets, and Kripke's least fixed point models of grounded truth. I develop a general formal theory of groundedness and explain how the well-founded sets, Cantor's extended number-sequence and Kripke's concepts of semantic groundedness are all instances of the general concept, and how the general framework illuminates these cases. Then, I develop a new approach to a grounded theory of proper (...) classes. -/- However, the general concept of groundedness does not account for the philosophical significance of its paradigm instances. Instead, I argue, the philosophical content of the cumulative hierarchy of sets is best understood in terms of a primitive notion of ontological priority. -/- Then, I develop an analogous account of Kripke's models. I show that they exemplify the in-virtue-of relation much discussed in contemporary metaphysics, and thus are philosophically significant. I defend my proposal against a challenge from Kripke's “ghost of the hierarchy”. (shrink)

Zermelo once wrote that he had anticipated Russell's contradiction of the set of all sets that are not members of themselves. Is this sufficient for having anticipated Russell's Paradox — the paradox that revealed the untenability of the logical notion of a set as an extension? This paper argues that it is not sufficient and offers criteria that are necessary and sufficient for having discovered Russell's Paradox. It is shown that there is ample evidence that Russell satisfied the criteria and (...) that Zermelo did not. (shrink)

A system of finite mathematics is proposed that has all of the power of classical mathematics. I believe that finite mathematics is not committed to any form of infinity, actual or potential, either within its theories or in the metalanguage employed to specify them. I show in detail that its commitments to the infinite are no stronger than those of primitive recursive arithmetic. The finite mathematics of sets is comprehensible and usable on its own terms, without appeal to any form (...) of the infinite. That makes it possible to, without circularity, obtain the axioms of full Zermelo-Fraenkel Set Theory with the Axiom of Choice (ZFC) by extrapolating (in a precisely defined technical sense) from natural principles concerning finite sets, including indefinitely large ones. The existence of such a method of extrapolation makes it possible to give a comparatively direct account of how we obtain knowledge of the mathematical infinite. The starting point for finite mathematics is Mycielski's work on locally finite theories. (shrink)

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. Written by some of the world's leading philosophers of mathematics, psychologists, and mathematicians, Mathematical Knowledge gives a lively sense of the current state of debate in this fascinating field. Contents 1. (...) Mary Leng: Introduction 2. Michael Potter: What is the problem of mathematical knowledge? 3. Tim Gowers: Mathematics, memory, and mental arithmetic 4. Alan Baker: Is there a problem of induction for mathematics? 5. Marinella Cappelletti and Valeria Giardino: The cognitive basis of mathematical knowledge 6. Mary Leng: What's there to know? A fictionalist account of mathematical knowledge 7. Mark Colyvan: Mathematical recreation versus mathematical knowledge 8. Alexander Paseau: Scientific platonism 9. Crispin Wright: On quantifying into predicate position: Steps towards a (new)tralist position. (shrink)