The Nature of Sets, Misc

We explain and explore class-theoretic potentialism—the view that one can always individuate more classes over a set-theoretic universe. We examine some motivations for class-theoretic potentialism, before proving some results concerning the relevant potentialist systems (in particular exhibiting failures of the $\mathsf {.2}$ and $\mathsf {.3}$ axioms). We then discuss the significance of these results for the different kinds of class-theoretic potentialists.

Hilary Putnam once suggested that “the actual existence of sets as ‘intangible objects’ suffers… from a generalization of a problem first pointed out by Paul Benacerraf… are sets a kind of function or are functions a sort of set?” Sadly, he did not elaborate; my aim, here, is to do so on his behalf. There are well-known methods for treating sets as functions and functions as sets. But these do not raise any obvious philosophical or foundational puzzles. For that, we (...) first need to provide a full-fledged function theory. I supply such a theory: it axiomatizes the iterative notion of function in exactly the same sense that ZF axiomatizes the iterative notion of set. Indeed, this function theory is synonymous with ZF. It might seem that set theory and function theory present us with rival foundations for mathematics, since they postulate different ontologies. But appearances are deceptive. Set theory and function theory provide the very same judicial foundation for mathematics. They do not supply rival metaphysical foundations; indeed, if they supply metaphysical foundations at all, then they supply the very same metaphysical foundations. (shrink)

On a very natural conception of sets, every set has an absolute complement. The ordinary cumulative hierarchy dismisses this idea outright. But we can rectify this, whilst retaining classical logic. Indeed, we can develop a boolean algebra of sets arranged in well-ordered levels. I show this by presenting Boolean Level Theory, which fuses ordinary Level Theory (from Part 1) with ideas due to Thomas Forster, Alonzo Church, and Urs Oswald. BLT neatly implement Conway’s games and surreal numbers; and a natural (...) extension of BLT is definitionally equivalent with ZF. (shrink)

In this paper one introduces for the first time the IndetermSoft Set, as extension of the classical (determinate) Soft Set, that deals with indeterminate data, and similarly the HyperSoft Set extended to IndetermHyperSoft Set, where ‘Indeterm’ stands for ‘Indeterminate’ (uncertain, conflicting, not unique outcome). They are built on an IndetermSoft Algebra that is an algebra dealing with IndetermSoft Operators resulted from our real world. Afterwards, the corresponding Fuzzy / Intuitionistic Fuzzy / Neutrosophic / and other fuzzy-extension IndetermSoft Set & IndetermHyperSoft (...) Set are presented together with their applications. (shrink)

The IndetermSoft Set is as an extension of the Soft Set, because the data, or the function, or the sets involved in the definition of the soft set have indeterminacy - as in our everyday life, and we still need to deal with such situations. And similarly, IndetermHyperSoft Set as extension of the HyperSoft Set, when there is indeterminate data, or indeterminate functions, or indeterminate sets. Herein, ‘Indeterm’ stands for ‘Indeterminate’ (uncertain, conflicting, incomplete, not unique outcome). We now introduce for (...) the first time the TreeSoft Set as extension of the MultiSoft Set. Several applications are presented for each type of soft set. (shrink)

Potentialists think that the concept of set is importantly modal. Using tensed language as an heuristic, the following bar-bones story introduces the idea of a potential hierarchy of sets: 'Always: for any sets that existed, there is a set whose members are exactly those sets; there are no other sets.' Surprisingly, this story already guarantees well-foundedness and persistence. Moreover, if we assume that time is linear, the ensuing modal set theory is almost definitionally equivalent with non-modal set theories; specifically, with (...) Level Theory, as developed in Part 1. (shrink)

The following bare-bones story introduces the idea of a cumulative hierarchy of pure sets: 'Sets are arranged in stages. Every set is found at some stage. At any stage S: for any sets found before S, we find a set whose members are exactly those sets. We find nothing else at S.' Surprisingly, this story already guarantees that the sets are arranged in well-ordered levels, and suffices for quasi-categoricity. I show this by presenting Level Theory, a simplification of set theories (...) due to Scott, Montague, Derrick, and Potter. (shrink)

Boolean-valued models of set theory were independently introduced by Scott, Solovay and Vopěnka in 1965, offering a natural and rich alternative for describing forcing. The original method was adapted by Takeuti, Titani, Kozawa and Ozawa to lattice-valued models of set theory. After this, Löwe and Tarafder proposed a class of algebras based on a certain kind of implication which satisfy several axioms of ZF. From this class, they found a specific 3-valued model called PS3 which satisfies all the axioms of (...) ZF, and can be expanded with a paraconsistent negation *, thus obtaining a paraconsistent model of ZF. The logic (PS3 ,*) coincides (up to language) with da Costa and D'Ottaviano logic J3, a 3-valued paraconsistent logic that have been proposed independently in the literature by several authors and with different motivations such as CluNs, LFI1 and MPT. We propose in this paper a family of algebraic models of ZFC based on LPT0, another linguistic variant of J3 introduced by us in 2016. The semantics of LPT0, as well as of its first-order version QLPT0, is given by twist structures defined over Boolean agebras. From this, it is possible to adapt the standard Boolean-valued models of (classical) ZFC to twist-valued models of an expansion of ZFC by adding a paraconsistent negation. We argue that the implication operator of LPT0 is more suitable for a paraconsistent set theory than the implication of PS3, since it allows for genuinely inconsistent sets w such that [(w = w)] = 1/2 . This implication is not a 'reasonable implication' as defined by Löwe and Tarafder. This suggests that 'reasonable implication algebras' are just one way to define a paraconsistent set theory. Our twist-valued models are adapted to provide a class of twist-valued models for (PS3,*), thus generalizing Löwe and Tarafder result. It is shown that they are in fact models of ZFC (not only of ZF). (shrink)

The paper is Part III of the large research, dedicated to both the revision of the system of basic logical categories and the generalization of modern predicate logic to functional logic. We determinate and contrapose modern Fregean logistics and proposed by the author ultra-Fregean logistics, next we describe values and arguments of functions, arguments of relations, relations themselves, sets (classes), and subsets (subclasses) as derivative categories (concepts) of ultrafregean logistics. Logistics is a part of metalogic, independent of semantics. Fregean logictics (...) is a metalogical theory, based on the quadruple <particular (individual), predicate, equality, sequence>; it generates predicate logic. Ultrafregean logictics is based on the quadruple <particular, function, representation, sequence>, where the notion of a function is a generalization of the notion of a predicate and the notion of representation is a generalization of the notion of equality; this logictics generates functional logic. For the completely correct denotation of the functional values, we need the Churchian symbolics with parenthesis. Predicates are usually identified with relations. A relation is the derived and even definable category of ultra-Fregean logictics. Namely, relations are representations by functions (of one of their arguments). We show that Frege could really establish this definition and the notion (category) of representation but, unfortunately, rejected this course of thought. Next, we show that every n-ary relation can be resolved for some of its arguments via some (n-1)-ary function. A set, or class, is a derived and not definable category of ultra-Fregean logistics. The universal way to introduce the sets is Frege’s abstraction principle. We formulate this principle for functional logic and show that the notion of a set is quantified, so there is the dual existential notion of a nonempty subset, involved by the same abstraction principle. (shrink)

In this thesis I argue against unrestricted mereological hybridism, the view that there are absolutely no constraints on wholes having parts from many different logical or ontological categories, an exemplar of which I take to be ‘mixed fusions’. These are composite entities which have parts from at least two different categories – the membered (as in classes) and the non-membered (as in individuals). As a result, mixed fusions can also be understood to represent a variety of cross-category summation such as (...) the abstract with the concrete, the physical with the non-physical, and the possible with the impossible, just to name a few. -/- Proposed by David Lewis (1991) alongside his defence of classical mereology (the major theory of parthood which permits such transcategorial composites through its principle of unrestricted composition) it is my contention that mixed fusions are an under-examined consequence of indiscriminate mereological fusion which harbour a multitude of complications. In my attempt to discern their substantive character, throughout this thesis I make a case study of mixed fusions and uncover several problematic consequences which I think follow from their most plausible assessment. -/- These include: (1) that mixed fusions’ probable membership relations may lead to dubious foundational loops in the mereological Universe, or (2) otherwise that mixed fusions oblige an implausible ontological priority of the mereological Universe as a whole; (3) that mixed fusions contradict the reductive account of set theory they are proposed within, by plausibly being seen to have the same members as their class parts, and (4) that mixed fusions therefore confound a mereological thesis of Composition as Identity, which some (including Lewis) use to support classical mereology – a consequence which is potentially self-defeating; (5) that mixed fusions as sums of abstract and concrete entities both subvert Lewis’s (1986) system of modal realism, while (6) also undermining less expansive theories of possible worlds; and finally, (7) that even where some of the foregoing is resisted, it remains implausible that mixed fusions are ontologically innocent, because their supposed distinction from their parts in this case ensures that they need to be counted as additional entities in one’s ontology. -/- To be clear, I do not advance a theory of mereological hybrid nihilism in the sense of denying all cases of transcategorial composition. (I only cover a few select instances of mereological hybridism via mixed fusions after all.) Rather, I deny that mereological hybridism is plausible in full generality, by demonstrating that any cases of it are at least limited by the constraints that I identify. This in turn vindicates a call for a restriction on parthood theories and composition principles which allow certain types of categorially mixed entities – including restricting classical mereology with its principle of unrestricted composition. -/- Although theories of parthood like the standard classical mereology are not ordinarily developed for the sake of mereological hybrids like mixed fusions, these and other transcategorial composites are still among the logical consequences of such parthood systems operating with sufficient generality. The significance of my thesis, then, comes from showcasing how some of these kinds of entities do not conform to the systems in which they are included as required, and hence I argue for the rejection of unrestricted mereological hybridism as well as any mereological principles which support it. (shrink)

In this paper, I argue that a naturalist approach in philosophy of mathematics justifies a pluralist conception of set theory. For the pluralist, there is not a Single Universe, but there is rather a Multiverse, composed by a plurality of universes generated by various set theories. In order to justify a pluralistic approach to sets, I apply the two naturalistic principles developed by Penelope Maddy (cfr. Maddy (1997)), UNIFY and MAXIMIZE, and analyze through them the potential of the set theoretic (...) multiverse to be the best framework for mathematical practice. According to UNIFY, an adequate set theory should be foundational, in the sense that it should allow one to represent all the currently accepted mathematical theories. As for MAXIMIZE, this states that any adequate set theory should be as powerful as possible, allowing one to prove as many results and isomorphisms as possible. In a recent paper, Maddy (2017) has argued that this two principle justify ZFC as the best framework for mathematical practice. I argue that, pace Maddy, these two principles justify a multiverse conception of set theory, more precisely, the generic multiverse with a core (GMH). (shrink)

In this paper, I describe and motivate a new species of mathematical structuralism, which I call Instrumental Nominalism about Set-Theoretic Structuralism. As the name suggests, this approach takes standard Set-Theoretic Structuralism of the sort championed by Bourbaki and removes its ontological commitments by taking an instrumental nominalist approach to that ontology of the sort described by Joseph Melia and Gideon Rosen. I argue that this avoids all of the problems that plague other versions of structuralism.

Paul Horwich (1990) once suggested restricting the T-Schema to the maximally consistent set of its instances. But Vann McGee (1992) proved that there are multiple incompatible such sets, none of which, given minimal assumptions, is recursively axiomatizable. The analogous view for set theory---that Naïve Comprehension should be restricted according to consistency maxims---has recently been defended by Laurence Goldstein (2006; 2013). It can be traced back to W.V.O. Quine(1951), who held that Naïve Comprehension embodies the only really intuitive conception of set (...) and should be restricted as little as possible. The view might even have been held by Ernst Zermelo (1908), who,according to Penelope Maddy (1988), subscribed to a ‘one step back from disaster’ rule of thumb: if a natural principle leads to contra-diction, the principle should be weakened just enough to block the contradiction. We prove a generalization of McGee’s Theorem, anduse it to show that the situation for set theory is the same as that for truth: there are multiple incompatible sets of instances of Naïve Comprehension, none of which, given minimal assumptions, is recursively axiomatizable. This shows that the view adumbrated by Goldstein, Quine and perhaps Zermelo is untenable. (shrink)

We propose certain clases that seem unable to form a completed totality though they are very small, finite, in fact. We suggest that the existence of such clases lends support to an interpretation of the existence of proper clases in terms of availability, not size.

The Hyperuniverse Programme, introduced in Arrigoni and Friedman (2013), fosters the search for new set-theoretic axioms. In this paper, we present the procedure envisaged by the programme to find new axioms and the conceptual framework behind it. The procedure comes in several steps. Intrinsically motivated axioms are those statements which are suggested by the standard concept of set, i.e. the `maximal iterative concept', and the programme identi fies higher-order statements motivated by the maximal iterative concept. The satisfaction of these statements (...) (H-axioms) in countable transitive models, the collection of which constitutes the `hyperuniverse' (H), has remarkable 1st-order consequences, some of which we review in section 5. (shrink)

A new computational methodology allowing one to work in a new way with infinities and infinitesimals is presented in this paper. The new approach, among other things, gives the possibility to calculate the number of elements of certain infinite sets, avoids indeterminate forms and various kinds of divergences. This methodology has been used by the author as a starting point in developing a new kind of computer – the Infinity Computer – able to execute computations and to store in its (...) memory not only finite numbers but also infinite and infinitesimal ones. (shrink)

Gödel’s philosophical conceptions bear striking similarities to Cantor’s. Although there is no conclusive evidence that Gödel deliberately used or adhered to Cantor’s views, one can successfully reconstruct and see his “Cantorianism” at work in many parts of his thought. In this paper, I aim to describe the most prominent conceptual intersections between Cantor’s and Gödel’s thought, particularly on such matters as the nature and existence of mathematical entities (sets), concepts, Platonism, the Absolute Infinite, the progress and inexhaustibility of mathematics.

A set is precisely defined. A given element either belongs or not to a set. However, since all of the elements being considered belong to the universe, if the element does not belong to the set, it belongs to its complement, that is, what remains after all of the elements from the set are removed from the universe.

Plena are large-scale macro-totalities appropriate to the realms of all facts, all truths, and all things. Our attempt here is to take some first technical steps toward an adequate conception of plena.

Some recent work by philosophers of mathematics has been aimed at showing that our knowledge of the existence of at least some mathematical objects and/or sets can be epistemically grounded by appealing to perceptual experience. The sensory capacity that they refer to in doing so is the ability to perceive numbers, mathematical properties and/or sets. The chief defense of this view as it applies to the perception of sets is found in Penelope Maddy’s Realism in Mathematics, but a number of (...) other philosophers have made similar, if more simple, appeals of this sort. For example, Jaegwon Kim (1981, 1982), John Bigelow (1988, 1990), and John Bigelow and Robert Pargetter (1990) have all defended such views. The main critical issue that will be raised here concerns the coherence of the notions of set perception and mathematical perception, and whether appeals to such perceptual faculties can really provide any justification for or explanation of belief in the existence of sets, mathematical properties and/or numbers. (shrink)

A set of parameters for classifying composition operations is introduced. These parameters determine whether a composition operation is 1) universal, 2) determinate, 3) whether there is a difference between possible and actual compositions, 4) whether there can be singleton compositions, 5) whether they give rise to a hierarchy, and 6) whether components of compositions can be repeated. Philosophical implications of these parameters (in particular in relation to set theory) and mereology are discussed.

There is no uniquely standard concept of an effectively decidable set of real numbers or real n-tuples. Here we consider three notions: decidability up to measure zero [M.W. Parker, Undecidability in Rn: Riddled basins, the KAM tori, and the stability of the solar system, Phil. Sci. 70(2) (2003) 359–382], which we abbreviate d.m.z.; recursive approximability [or r.a.; K.-I. Ko, Complexity Theory of Real Functions, Birkhäuser, Boston, 1991]; and decidability ignoring boundaries [d.i.b.; W.C. Myrvold, The decision problem for entanglement, in: R.S. (...) Cohen et al. (Eds.), Potentiality, Entanglement, and Passion-at-a-Distance: Quantum Mechanical Studies fo Abner Shimony, Vol. 2, Kluwer Academic Publishers, Great Britain, 1997, pp. 177–190]. Unlike some others in the literature, these notions apply not only to certain nice sets, but to general sets in Rn and other appropriate spaces. We consider some motivations for these concepts and the logical relations between them. It has been argued that d.m.z. is especially appropriate for physical applications, and on Rn with the standard measure, it is strictly stronger than r.a. [M.W. Parker, Undecidability in Rn: Riddled basins, the KAM tori, and the stability of the solar system, Phil. Sci. 70(2) (2003) 359–382]. Here we show that this is the only implication that holds among our three decidabilities in that setting. Under arbitrary measures, even this implication fails. Yet for intervals of non-zero length, and more generally, convex sets of non-zero measure, the three concepts are equivalent. (shrink)

In the article the problem of imprecise information and concepts is considered. The theory of rough sets and the theory of fuzzy sets are used to provide an original solution to this problem.

Prominent constructive theories of sets as Martin-Löf type theory and Aczel and Myhill constructive set theory, feature a distinctive form of constructivity: predicativity. This may be phrased as a constructibility requirement for sets, which ought to be finitely specifiable in terms of some uncontroversial initial “objects” and simple operations over them. Predicativity emerged at the beginning of the 20th century as a fundamental component of an influential analysis of the paradoxes by Poincaré and Russell. According to this analysis the paradoxes (...) are caused by a vicious circularity in definitions; adherence to predicativity was therefore proposed as a systematic method for preventing such problematic circularity. In the following, I sketch the origins of predicativity, review the fundamental contributions by Russell and Weyl and look at modern incarnations of this notion. (shrink)

This paper builds on the system of David Lewis’s “Parts of Classes” to provide a foundation for mathematics that arguably requires not only no distinctively mathematical ideological commitments (in the sense of Quine), but also no distinctively mathematical ontological commitments. Provided only that there are enough individual atoms, the devices of plural quantification and mereology can be employed to simulate quantification over classes, while at the same time allowing all of the atoms (and most of their fusions with which we (...) are concerned) to be individuals (that is, urelements of classes). The final section of the paper canvasses some reasons to be committed to the required ontology for other than mathematical reasons. (shrink)