The Nature of Sets

The ontological pictures underpinning David Lewis's Parts of Classes and On the Plurality of Worlds are in some tension. One tension concerns whether the sets and classes of Parts of Classes can be found in Lewis's modal space, since they cannot in general be parts of any possible world. The second is that the atoms that are the mathematical ontology of Parts of Classes seem to meet the criteria for being possible worlds themselves, and so fail to be the material (...) Parts of Classes needs. Two different responses to these tensions are discussed: one is unappealing in several ways but keeps more of Lewis's doctrines, while the other requires some modifications to the system of Parts of Classes. (shrink)

This paper presents for the first time the IndetermSoft Set, as an extension of the classical (determinate) Soft Set, which operates on indeterminate data, and similarly the HyperSoft Set extended to the IndetermHyperSoft Set, where 'Indeterm' means 'Indeterminate' (uncertain, conflicting, non-unique result). They are built on an IndetermSoft Algebra which is an algebra dealing with IndetermSoft Operators resulting from our real world. Subsequently, the IndetermSoft and IndetermHyperSoft Sets and their Fuzzy/Fuzzy Intuitionistic/Neutrosophic and other fuzzy extensions and their applications are presented.

This is a short piece of humor (I hope) on nonstandard set theories. An earlier version appeared in Bull. EATCS 45: 146-147 (1991).

From the Publisher: -/- This book presents a new powerful supercomputing paradigm introduced by Yaroslav D. Sergeyev -/- It gives a friendly introduction to the paradigm and proposes a broad panorama of a successful usage of numerical infinities -/- The volume covers software implementations of the Infinity Computer -/- Abstract -/- This book provides a friendly introduction to the paradigm and proposes a broad panorama of killing applications of the Infinity Computer in optimization: radically new numerical algorithms, great theoretical insights, (...) efficient software implementations, and interesting practical case studies. This is the first book presenting to the readers interested in optimization the advantages of a recently introduced supercomputing paradigm that allows to numerically work with different infinities and infinitesimals on the Infinity Computer patented in several countries. One of the editors of the book is the creator of the Infinity Computer, and another editor was the first who has started to use it in optimization. Their results were awarded by numerous scientific prizes. This engaging book opens new horizons for researchers, engineers, professors, and students with interests in supercomputing paradigms, optimization, decision making, game theory, and foundations of mathematics and computer science. -/- “Mathematicians have never been comfortable handling infinities… But an entirely new type of mathematics looks set to by-pass the problem… Today, Yaroslav Sergeyev, a mathematician at the University of Calabria in Italy solves this problem… ” -/- MIT Technology Review -/- “These ideas and future hardware prototypes may be productive in all fields of science where infinite and infinitesimal numbers (derivatives, integrals, series, fractals) are used.” A. Adamatzky, Editor-in-Chief of the International Journal of Unconventional Computing. -/- “I am sure that the new approach … will have a very deep impact both on Mathematics and Computer Science.” D. Trigiante, Computational Management Science. -/- “Within the grossone framework, it becomes feasible to deal computationally with infinite quantities, in a way that is both new (in the sense that previously intractable problems become amenable to computation) and natural”. R. Gangle, G. Caterina, F. Tohmé, Soft Computing. -/- “The computational features offered by the Infinity Computer allow us to dynamically change the accuracy of representation and floating-point operations during the flow of a computation. When suitably implemented, this possibility turns out to be particularly advantageous when solving ill-conditioned problems. In fact, compared with a standard multi-precision arithmetic, here the accuracy is improved only when needed, thus not affecting that much the overall computational effort.” P. Amodio, L. Brugnano, F. Iavernaro & F. Mazzia, Soft Computing. (shrink)

Benacerraf’s 1965 multiple-reductions argument depends on what I call ‘deferential logicism’: his necessary condition for number-set identity is most plausible against a background Quineanism that allows autonomy of the natural number concept. Steinhart’s ‘folkist’ sufficient condition on number-set identity, by contrast, puts that autonomy at the center — but fails for not taking the folk perspective seriously enough. Learning from both sides, we explore new conditions on number-set identity, elaborating a suggestion from Wright.

Suppose one has a system, the infinite set of positive integers, P, and one wants to study the characteristics of a subset (or subsystem) of that system, the infinite subset of odd positives, O, relative to the overall system. In mathematics, this is done by pairing off each odd with a positive, using a function such as O=2P+1. This puts the odds in a one-to-one correspondence with the positives, thereby, showing that the subset of odds and the original set of (...) positives are the same size, or have the same cardinality. This counter-intuitive result ignores the “natural” relationship of one odd for every two positives in the sequence of positive integers, which would suggest that O is one-half the size of P. However, in the set of axioms that constitute mathematics, it is considered valid. Fair enough. In the physical universe (i.e., the starting system), though, relationships between entities matter. In biochemistry, if you start with an organism, say a rat, and you want to study its heart, you can do this by removing some heart cells and studying them in isolation in a cell culture system. But, the results often differ compared to what occurs in the intact animal because studying the isolated cultured cells ignores the relationships in the intact body between the cells, the rest of the heart tissue and the rest of the rat. In chemistry, if a copper atom were studied in isolation, it would never be known that copper atoms in bulk can conduct electricity because the atoms share their electrons. In physics, the relationships between inertial reference frames in relativity, and observer and observed in quantum physics can't be ignored. Relationships matter in the physical world, but the mathematics of infinite sets is still used to describe it. Does this matter? It seems to, at least in physics. Infinities cause numerous problems in theoretical physics such as non-renormalizability and problems in unifying quantum mehanics and general relativity . This suggests that the pairing off method and the mathematics of infinite sets based on it are analogous to a cell culture system or studying a copper atom in isolation if they are used in studying the physical universe because they ignore the inherent relationships between entities. In the real, physical world, the natural, inherent, relationships between entities can't be ignored. Said another way, the set of axioms that constitute abstract mathematics may be similar but not identical to the set of physical axioms by which the real, physical universe runs. This suggests that the results from abstract mathematics about infinities may not apply to or should be modified for use in physics. (shrink)

What is the relation between some things and the set of these things? Mathematical practice does not provide a univocal answer. On the one hand, it relies on ordinary plural talk, which is implicitly committed to a traditional form of plural logic. On the other hand, mathematical practice favors a liberal view of definitions which entails that traditional plural logic must be restricted. We explore this predicament and develop a “critical” alternative to traditional plural logic.

Plural expressions found in natural languages allow us to talk about many objects simultaneously. Plural logic — a logical system that takes plurals at face value — has seen a surge of interest in recent years. This book explores its broader significance for philosophy, logic, and linguistics. What can plural logic do for us? Are the bold claims made on its behalf correct? After introducing plural logic and its main applications, the book provides a systematic analysis of the relation between (...) this logic and other theoretical frameworks such as set theory, mereology, higher-order logic, and modal logic. The applications of plural logic rely on two assumptions, namely that this logic is ontologically innocent and has great expressive power. These assumptions are shown to be problematic. The result is a more nuanced picture of plural logic's applications than has been given thus far. Questions about the correct logic of plurals play a central role in the final chapters, where traditional plural logic is rejected in favor of a "critical" alternative. The most striking feature of this alternative is that there is no universal plurality. This leads to a novel approach to the relation between the many and the one. In particular, critical plural logic paves the way for an account of sets capable of solving the set-theoretic paradoxes. (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.

Brief note explaining the content, importance, and historical context of my joint translation of Quine's The Significance of the New Logic with my single-authored historical-philosophical essay 'Willard Van Orman Quine's Philosophical Development in the 1930s and 1940s'.

One result of this note is about the nonconstructivity of countably infinite lotteries: even if we impose very weak conditions on the assignment of probabilities to subsets of natural numbers we cannot prove the existence of such assignments constructively, i.e., without something such as the axiom of choice. This is a corollary to a more general theorem about large-small filters, a concept that extends the concept of free ultrafilters. The main theorem is that proving the existence of large-small filters requires (...) a nonconstructive axiom like AC. (shrink)

Structuralist foundations of mathematics aim for an ‘invariant’ conception of mathematics. But what should be their basic objects? Two leading answers emerge: higher groupoids or higher categories. I argue in favor of the former over the latter. First, I explain why to choose between them we need to ask the question of what is the correct ‘categorified’ version of a set. Second, I argue in favor of groupoids over categories as ‘categorified’ sets by introducing a pre-formal understanding of groupoids as (...) abstract shapes. This conclusion lends further support to the perspective taken by the Univalent Foundations of mathematics. (shrink)

Foundations of Set Theory discusses the reconstruction undergone by set theory in the hands of Brouwer, Russell, and Zermelo. Only in the axiomatic foundations, however, have there been such extensive, almost revolutionary, developments. This book tries to avoid a detailed discussion of those topics which would have required heavy technical machinery, while describing the major results obtained in their treatment if these results could be stated in relatively non-technical terms. This book comprises five chapters and begins with a discussion of (...) the antinomies that led to the reconstruction of set theory as it was known before. It then moves to the axiomatic foundations of set theory, including a discussion of the basic notions of equality and extensionality and axioms of comprehension and infinity. The next chapters discuss type-theoretical approaches, including the ideal calculus, the theory of types, and Quine's mathematical logic and new foundations; intuitionistic conceptions of mathematics and its constructive character; and metamathematical and semantical approaches, such as the Hilbert program. This book will be of interest to mathematicians, logicians, and statisticians. (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)

Cantor’s proof that the powerset of the set of all natural numbers is uncountable yields a version of Richard’s paradox when restricted to the full definable universe, that is, to the universe containing all objects that can be defined not just in one formal language but by means of the full expressive power of natural language: this universe seems to be countable on one account and uncountable on another. We argue that the claim that definitional contexts impose restrictions on the (...) scope of quantifiers reveals a natural way out. (shrink)

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.

It is a commonplace of set theory to say that there is no set of all well-orderings nor a set of all sets. We are implored to accept this due to the threat of paradox and the ensuing descent into unintelligibility. In the absence of promising alternatives, we tend to take up a conservative stance and tow the line: there is no universe. In this paper, I am going to challenge this claim by taking seriously the idea that we can (...) talk about the collection of all the sets and many more collections beyond that. A method of articulating this idea is offered through an indefinitely extending hierarchy of set theories. It is argued that this approach provides a natural extension to ordinary set theory and leaves ordinary mathematical practice untouched. (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.

Transfinite recursion is an essential component of set theory. In this paper, we seek intrinsically justified reasons for believing in recursion and the notions of higher computation that surround it. In doing this, we consider several kinds of recursion principles and prove results concerning their relation to one another. We then consider philosophical motivations for these formal principles coming from the idea that computational notions lie at the core of our conception of set. This is significant because, while the iterative (...) conception of set has been widely recognized as insufficient to establish replacement and recursion, its supplementation by considerations pertaining to algorithms suggests a new and philosophically well-motivated reason to believe in such principles. (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)

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)

NOWADAYS, even schoolchildren babble about "null sets" and "singletons" and "one-one correspondences," as if they knew what they were talking about. But if they understand even less than their teachers, which seems likely, they must be using the technical jargon with only an illusion of understanding. Beginners are taught that a set having three members is a single thing, wholly constituted by its members but distinct from them. After this, the theological doctrine of the Trinity as "three in one" should (...) be child's play. (shrink)

In recent years, many people writing on set theory have invoked the notion of an indefinitely extensible concept. The notion, it is usually claimed, plays an important role in solving the paradoxes of absolute infinity. It is not clear, however, how the notion should be formulated in a coherent way, since it appears to run into a number of problems concerning, for example, unrestricted quantification. In fact, the notion makes perfectly good sense if one endorses a dialetheic solution to the (...) paradoxes. It then morphs from a supposed solution to the paradoxes into a diagnosis of their structure. In this paper I show how. (shrink)

The aim of this paper is to present and discuss the philosophical views concerning mathematics of the founders of the so called Warsaw Mathematical School, i.e., Wacław Sierpiński, Zygmunt Janiszewski and Stefan Mazurkiewicz. Their interest in the philosophy of mathematics and their philosophical papers will be considered. We shall try to answer the question whether their philosophical views influenced their proper mathematical investigations. Their views towards set theory and its rôle in mathematics will be emphasized.

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)

Our main inspiration is the work in paper (Gitik and Shelah in Isr J Math 124(1):221–242, 2001). We will prove that for a partition \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{A}}$$\end{document} of the real line into meager sets and for any sequence \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{A}_n}$$\end{document} of subsets of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{A}}$$\end{document} one can find a sequence \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} (...) \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{B}_n}$$\end{document} such that \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{B}_{n}}$$\end{document}’s are pairwise disjoint and have the same “outer measure with respect to the ideal of meager sets”. We get also generalization of this result to a class of σ-ideals posessing Suslin property. However, in that case we use additional set-theoretical assumption about non-existing of quasi-measurable cardinal below continuum. (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)

Following historical developments, this article traces two basic motives for employing sets within a physical setting and discusses whether they truly pose a problem for ‘mathematical naturalism’.

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.

This paper assesses the philosophical heritage of Jacob Klein’s thought through an analysis of the key tenets of his Greek Mathematical Thought and theOrigin of Algebra. Threads of Klein’s thought are distinguished and subsequently singled out (phenomenological, epistemological, and anti-ontological; historical, ontological, and critical), and the peculiar way in which Klein’s project brings together ontology and history of mathematics is investigated. Plato’s theoretical logistic and Klein’s understanding thereof are questioned—especially the claim that the Platonic distinction between practical and theoretical logistic (...) is historically neglected because of Plato’s understanding of the manner of being of mathematical objects—in order to advance the claim that Klein ontologically overdetermines the history of mathematics in a manner that ends up limiting some of his most brilliant analyses of the Greek conception of “numbers” and the philosophical meaning of the notion of “multiplicity.”. (shrink)

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)

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)

The paper is devoted to the problem of the existence of mathematical objects. The ideas of Godel and the Quine-Putnam indispensability argument are discussed. A „qualitative” version of this argument, in which the results of reverse mathematics are used, is presented.

In the article, Woodin’s program (for setting up axioms, which decide the continuum hypothesis) is presented, and some philosophical aspects of it are discussed. In particular, the general problem of justifying axioms of set theory is discussed in the context of the relation between set theory and mainstream mathematics.

More often than not, recently popular structuralist interpretations of physical theories leave the central concept of a structure insufficiently precisified. The incipient causal sets approach to quantum gravity offers a paradigmatic case of a physical theory predestined to be interpreted in structuralist terms. It is shown how employing structuralism lends itself to a natural interpretation of the physical meaning of causal set theory. Conversely, the conceptually exceptionally clear case of causal sets is used as a foil to illustrate how a (...) mathematically informed rigorous conceptualization of structure serves to identify structures in physical theories. Furthermore, a number of technical issues infesting structuralist interpretations of physical theories such as difficulties with grounding the identity of the places of highly symmetrical physical structures in their relational profile and what may resolve these difficulties can be vividly illustrated with causal sets. (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)