The incompleteness of set theory ZF C leads one to look for natural nonconservative extensions of ZF C in which one can prove statements independent of ZF C which appear to be “true”. One approach has been to add large cardinal axioms.Or, one can investigate second-order expansions like Kelley-Morse class theory, KM or Tarski-Grothendieck set theory T G or It is a nonconservative extension of ZF C and is obtained from other axiomatic set theories by the inclusion (...) of Tarski’s axiom which implies the existence of inaccessible cardinals. See also related set theory with a filter quantifier ZF (aa). In this paper we look at a set theory NC# ∞# , based on bivalent gyper infinitary logic with restricted Modus Ponens Rule In this paper we deal with set theory NC# ∞# based on bivalent gyper infinitary logic with Restricted Modus Ponens Rule. Nonconservative extensions of the canonical internal set theories IST and HST are proposed. (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)

Non-well-founded set theories allow set-theoretic exotica that standard ZFC will not allow, such as a set that has itself as its sole member. We can distinguish plenitudinous non-well-founded set theories, such as Boffa set theory, that allow infinitely many such sets, from restrictive theories, such as Finsler-Aczel or AFA, that allow exactly one. Plenitudinous non-well-founded set theories face a puzzle: nothing seems to explain the identity or distinctness of various of the sets they countenance. In this paper I aim (...) to sharpen this puzzle, make clear who it does and does not apply to and, ultimately, to argue in favor of a plenitudinous theory like Boffa. (shrink)

According to Cantor (Mathematische Annalen 21:545–586, 1883 ; Cantor’s letter to Dedekind, 1899 ) a set is any multitude which can be thought of as one (“jedes Viele, welches sich als Eines denken läßt”) without contradiction—a consistent multitude. Other multitudes are inconsistent or paradoxical. Set theoretical paradoxes have common root—lack of understanding why some multitudes are not sets. Why some multitudes of objects of thought cannot themselves be objects of thought? Moreover, it is a logical truth that such multitudes do (...) exist. However we do not understand this logical truth so well as we understand, for example, the logical truth $${\forall x \, x = x}$$ . In this paper we formulate a logical truth which we call the productivity principle. Rusell (Proc Lond Math Soc 4(2):29–53, 1906 ) was the first one to formulate this principle, but in a restricted form and with a different purpose. The principle explicates a logical mechanism that lies behind paradoxical multitudes, and is understandable as well as any simple logical truth. However, it does not explain the concept of set. It only sets logical bounds of the concept within the framework of the classical two valued $${\in}$$ -language. The principle behaves as a logical regulator of any theory we formulate to explain and describe sets. It provides tools to identify paradoxical classes inside the theory. We show how the known paradoxical classes follow from the productivity principle and how the principle gives us a uniform way to generate new paradoxical classes. In the case of ZFC set theory the productivity principle shows that the limitation of size principles are of a restrictive nature and that they do not explain which classes are sets. The productivity principle, as a logical regulator, can have a definite heuristic role in the development of a consistent set theory. We sketch such a theory—the cumulative cardinal theory of sets. The theory is based on the idea of cardinality of collecting objects into sets. Its development is guided by means of the productivity principle in such a way that its consistency seems plausible. Moreover, the theory inherits good properties from cardinal conception and from cumulative conception of sets. Because of the cardinality principle it can easily justify the replacement axiom, and because of the cumulative property it can easily justify the power set axiom and the union axiom. It would be possible to prove that the cumulative cardinal theory of sets is equivalent to the Morse–Kelley set theory. In this way we provide a natural and plausibly consistent axiomatization for the Morse–Kelley set theory. (shrink)

We adjust the notion of typicality originated with Russell, which was introduced and studied in a previous paper for general first-order structures, to make it expressible in the language of set theory. The adopted definition of the class ${\rm NT}$ of nontypical sets comes out as a natural strengthening of Russell's initial definition, which employs properties of small (minority) extensions, when the latter are restricted to the various levels $V_\zeta$ of $V$. This strengthening leads to defining ${\rm NT}$ as (...) the class of sets that belong to some countable ordinal definable set. It follows that ${\rm OD}\subseteq {\rm NT}$ and hence ${\rm HOD}\subseteq {\rm HNT}$. It is proved that the class ${\rm HNT}$ of hereditarily nontypical sets is an inner model of ${\rm ZF}$. Moreover the (relative) consistency of $V\neq {\rm NT}$ is established, by showing that in many forcing extensions $M[G]$ the generic set $G$ is a typical element of $M[G]$, a fact which is fully in accord with the intuitive meaning of typicality. In particular it is consistent that there exist continuum many typical reals. In addition it follows from a result of Kanovei and Lyubetsky that ${\rm HOD}\neq {\rm HNT}$ is also relatively consistent. In particular it is consistent that ${\cal P}(\omega)\cap {\rm OD}\subsetneq{\cal P}(\omega)\cap {\rm NT}$. However many questions remain open, among them the consistency of ${\rm HOD}\neq {\rm HNT}\neq V$, ${\rm HOD}={\rm HNT}\neq V$ and ${\rm HOD}\neq {\rm HNT}= V$. (shrink)

In this paper we view the first order set theory ZFC under the canonical frst order semantics and the second order set theory ZFC_2 under the Henkin semantics. Main results are: (i) Let M_st^ZFC be a standard model of ZFC, then ¬Con(ZFC + ∃M_st^ZFC ). (ii) Let M_stZFC_2 be a standard model of ZFC2 with Henkin semantics, then ¬Con(ZFC_2 +∃M_stZFC_2). (iii) Let k be inaccessible cardinal then ¬Con(ZFC + ∃κ). In order to obtain the statements (i) and (ii) (...) examples of the inconsistent countable set in a set theory ZFC + ∃M_stZFC and in a set theory ZFC2 + ∃M_st^ZFC_2 were derived. It is widely believed that ZFC + ∃M_stZFC and ZFC_2 + ∃M_st^ZFC_2 are consistent, i.e. ZFC and ZFC_2 have a standard models. Unfortunately this belief is wrong. Book. Advances in Mathematics and Computer Science Vol. 1 Chapter 3 There is No Standard Model of ZFC and ZFC2 ISBN-13 (15) 978-81-934224-1-0 See Part II of this paper DOI: 10.4236/apm.2019.99034 . (shrink)

The iterative conception of set is typically considered to provide the intuitive underpinnings for ZFCU (ZFC+Urelements). It is an easy theorem of ZFCU that all sets have a definite cardinality. But the iterative conception seems to be entirely consistent with the existence of “wide” sets, sets (of, in particular, urelements) that are larger than any cardinal. This paper diagnoses the source of the apparent disconnect here and proposes modifications of the Replacement and Powerset axioms so as to allow for the (...) existence of wide sets. Drawing upon Cantor’s notion of the absolute infinite, the paper argues that the modifications are warranted and preserve a robust iterative conception of set. The resulting theory is proved consistent relative to ZFC + “there exists an inaccessible cardinal number.”. (shrink)

It is standard in set theory to assume that Cantor's Theorem establishes that the continuum is an uncountable set. A challenge for this position comes from the observation that through forcing one can collapse any cardinal to the countable and that the continuum can be made arbitrarily large. In this paper, we present a different take on the relationship between Cantor's Theorem and extensions of universes, arguing that they can be seen as showing that every set is countable and (...) that the continuum is a proper class. We examine several principles based on maximality considerations in this framework, and show how some (namely Ordinal Inner Model Hypotheses) enable us to incorporate standard set theories (including ZFC with large cardinals added). We conclude that the systems considered raise questions concerning the foundational purposes of set theory. (shrink)

The incompleteness of set theory ZFC leads one to look for natural extensions of ZFC in which one can prove statements independent of ZFC which appear to be "true". One approach has been to add large cardinal axioms. Or, one can investigate second-order expansions like Kelley-Morse class theory, KM or Tarski- Grothendieck set theory TG [1]-[3] It is a non-conservative extension of ZFC and is obtaineed from other axiomatic set theories by the inclusion of Tarski's axiom which (...) implies the existence of inaccessible cardinals [1].Non-conservative extension of ZFC based on an generalized quantifiers considered in [4]. In this paper we look at a set theory NC_{∞^{#}}^{#},based on bivalent gyper infinitary logic with restricted Modus Ponens Rule [5]-[8]. In this paper we deal with set theory NC_{∞^{#}}^{#} based on gyper infinitary logic with Restricted Modus Ponens Rule. Set theory NC_{∞^{}}^{} contains Aczel's anti-foundation axiom [9]. We present a new approach to the invariant subspace problem for Hilbert spaces. Our main result will be that: if T is a bounded linear operator on an infinite-dimensional complex separable Hilbert space H,it follow that T has a non-trivial closed invariant subspace. Non-conservative extension based on set theory NC_{∞}^{#} of the model theoretical nonstandard analysis [10]-[12] also is considered. (shrink)

In 1980 F. Wattenberg constructed the Dedekind completion

d of the Robinson non-archimedean field

and established basic algebraic properties of

d [6]. In 1985 H. Gonshor established further fundamental properties of

d [7].In [4] important construction of summation of countable sequence of Wattenberg numbers was proposed and corresponding basic properties of such summation were considered. In this paper the important applications of the Dedekind completion

d in transcendental number theory were considered. We dealing using set theory ZFC
(
-model (...) of ZFC).Given an class of analytic functions of one complex variable f  

z, we investigate the arithmetic nature of the values of fz at transcendental points en, n  .Main results are: (i) the both numbers e
 and e   are irrational, (ii) number ee is transcendental. Nontrivial generalization of the Lindemann- Weierstrass theorem is obtained. (shrink)

Those incompleteness theorems mean the relation of (Peano) arithmetic and (ZFC) set theory, or philosophically, the relation of arithmetical finiteness and actual infinity. The same is managed in the framework of set theory by the axiom of choice (respectively, by the equivalent well-ordering "theorem'). One may discuss that incompleteness form the viewpoint of set theory by the axiom of choice rather than the usual viewpoint meant in the proof of theorems. The logical corollaries from that "nonstandard" viewpoint (...) the relation of set theory and arithmetic are demonstrated. (shrink)

Let f(1)=2, f(2)=4, and let f(n+1)=f(n)! for every integer n≥2. Edmund Landau's conjecture states that the set P(n^2+1) of primes of the form n^2+1 is infinite. Landau's conjecture implies the following unproven statement Φ: card(P(n^2+1))<ω ⇒ P(n^2+1)⊆[2,f(7)]. Let B denote the system of equations: {x_j!=x_k: i,k∈{1,...,9}}∪{x_i⋅x_j=x_k: i,j,k∈{1,...,9}}. The system of equations {x_1!=x_1, x_1 \cdot x_1=x_2, x_2!=x_3, x_3!=x_4, x_4!=x_5, x_5!=x_6, x_6!=x_7, x_7!=x_8, x_8!=x_9} has exactly two solutions in positive integers x_1,...,x_9, namely (1,...,1) and (f(1),...,f(9)). No known system S⊆B with a finite (...) number of solutions in positive integers x_1,...,x_9 has a solution (x_1,...,x_9)∈(N\{0})^9 satisfying max(x_1,...,x_9)>f(9). For every known system S⊆B, if the finiteness/infiniteness of the set {(x_1,...,x_9)∈(N\{0})^9: (x_1,...,x_9) solves S} is unknown, then the statement ∃ x_1,...,x_9∈N\{0} ((x_1,...,x_9) solves S)∧(max(x_1,...,x_9)>f(9)) remains unproven. Let Λ denote the statement: if the system of equations {x_2!=x_3, x_3!=x_4, x_5!=x_6, x_8!=x_9, x_1 \cdot x_1=x_2, x_3 \cdot x_5=x_6, x_4 \cdot x_8=x_9, x_5 \cdot x_7=x_8} has at most finitely many solutions in positive integers x_1,...,x_9, then each such solution (x_1,...,x_9) satisfies x_1,...,x_9≤f(9). The statement Λ is equivalent to the statement Φ. It heuristically justifies the statement Φ . This justification does not yield the finiteness/infiniteness of P(n^2+1). We present a new heuristic argument for the infiniteness of P(n^2+1), which is not based on the statement Φ. Algorithms always terminate. We explain the distinction between existing algorithms (i.e. algorithms whose existence is provable in ZFC) and known algorithms (i.e. algorithms whose definition is constructive and currently known). Assuming that the infiniteness of a set X⊆N is false or unproven, we define which elements of X are classified as known. No known set X⊆N satisfies Conditions (1)-(4) and is widely known in number theory or naturally defined, where this term has only informal meaning. *** (1) A known algorithm with no input returns an integer n satisfying card(X)<ω ⇒ X⊆(-∞,n]. (2) A known algorithm for every k∈N decides whether or not k∈X. (3) No known algorithm with no input returns the logical value of the statement card(X)=ω. (4) There are many elements of X and it is conjectured, though so far unproven, that X is infinite. (5) X is naturally defined. The infiniteness of X is false or unproven. X has the simplest definition among known sets Y⊆N with the same set of known elements. *** Conditions (2)-(5) hold for X=P(n^2+1). The statement Φ implies Condition (1) for X=P(n^2+1). The set X={n∈N: the interval [-1,n] contains more than 29.5+\frac{11!}{3n+1}⋅sin(n) primes of the form k!+1} satisfies Conditions (1)-(5) except the requirement that X is naturally defined. 501893∈X. Condition (1) holds with n=501893. card(X∩[0,501893])=159827. X∩[501894,∞)= {n∈N: the interval [-1,n] contains at least 30 primes of the form k!+1}. We present a table that shows satisfiable conjunctions of the form #(Condition 1) ∧ (Condition 2) ∧ #(Condition 3) ∧ (Condition 4) ∧ #(Condition 5), where # denotes the negation ¬ or the absence of any symbol. No set X⊆N will satisfy Conditions (1)-(4) forever, if for every algorithm with no input, at some future day, a computer will be able to execute this algorithm in 1 second or less. The physical limits of computation disprove this assumption. (shrink)

Classical interpretations of Goedels formal reasoning, and of his conclusions, implicitly imply that mathematical languages are essentially incomplete, in the sense that the truth of some arithmetical propositions of any formal mathematical language, under any interpretation, is, both, non-algorithmic, and essentially unverifiable. However, a language of general, scientific, discourse, which intends to mathematically express, and unambiguously communicate, intuitive concepts that correspond to scientific investigations, cannot allow its mathematical propositions to be interpreted ambiguously. Such a language must, therefore, define mathematical truth (...) verifiably. We consider a constructive interpretation of classical, Tarskian, truth, and of Goedel's reasoning, under which any formal system of Peano Arithmetic---classically accepted as the foundation of all our mathematical Languages---is verifiably complete in the above sense. We show how some paradoxical concepts of Quantum mechanics can, then, be expressed, and interpreted, naturally under a constructive definition of mathematical truth. (shrink)

In this paper, I argue that one of the arguments usually put forward in defence of universism is in tension with current set theoretic practice. According to universism, there is only one set theoretic universe, V, and when applying the method of forcing we are not producing new universes, but only simulating them inside V. Since the usual interpretation of set generic forcing is used to produce a “simulation” of an extension of V from a countable set inside V itself, (...) the above argument is credited to be a strong defence of universism. However, I claim, such an argument does not take into account current mathematical practice. Indeed, it is possible to find theorems that are available to the multiversists but that the advocate of universism cannot prove. For example, it is possible to prove results on infinite games in non-well-founded set-theories plus the axiom of determinacy (such as ZF + AFA + PD) that are not available in ZFC + PD. These results, I contend, are philosophically problematic on a strict universist approach to forcing. I suggest that the best way to avoid the difficulty is to adopt a pluralist conception of set theory and embrace a set theoretic multiverse. Consequently, the current practice of set generic forcing better supports a multiverse conception of set theory. (shrink)

We address Steel’s Programme to identify a ‘preferred’ universe of set theory and the best axioms extending ZFC by using his multiverse axioms MV and the ‘core hypothesis’. In the first part, we examine the evidential framework for MV, in particular the use of large cardinals and of ‘worlds’ obtained through forcing to ‘represent’ alternative extensions of ZFC. In the second part, we address the existence and the possible features of the core of MV_T (where T is ZFC+Large Cardinals). (...) In the last part, we discuss the hypothesis that the core is Ultimate-L, and examine whether and how, based on this fact, the Core Universist can justify V=Ultimate-L as the best (and ultimate) extension of ZFC. To this end, we take into account several strategies, and assess their prospects in the light of MV’s evidential framework. (shrink)

This essay examines the philosophical significance of $\Omega$-logic in Zermelo-Fraenkel set theory with choice (ZFC). The categorical duality between coalgebra and algebra permits Boolean-valued algebraic models of ZFC to be interpreted as coalgebras. The hyperintensional profile of $\Omega$-logical validity can then be countenanced within a coalgebraic logic. I argue that the philosophical significance of the foregoing is two-fold. First, because the epistemic and modal and hyperintensional profiles of $\Omega$-logical validity correspond to those of second-order logical consequence, $\Omega$-logical validity is (...) genuinely logical. Second, the foregoing provides a hyperintensional account of the interpretation of mathematical and metamathematical vocabulary. (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)

We introduce and consider the inner-model reflection principle, which asserts that whenever a statement \varphi(a) in the first-order language of set theory is true in the set-theoretic universe V, then it is also true in a proper inner model W \subset A. A stronger principle, the ground-model reflection principle, asserts that any such \varphi(a) true in V is also true in some non-trivial ground model of the universe with respect to set forcing. These principles each express a form of (...) width reflection in contrast to the usual height reflection of the Lévy–Montague reflection theorem. They are each equiconsistent with ZFC and indeed \Pi_2-conservative over ZFC, being forceable by class forcing while preserving any desired rank-initial segment of the universe. Furthermore, the inner-model reflection principle is a consequence of the existence of sufficient large cardinals, and lightface formulations of the reflection principles follow from the maximality principle MP and from the inner-model hypothesis IMH. We also consider some questions concerning the expressibility of the principles. (shrink)

The present first part about the eventual completeness of mathematics (called “Hilbert mathematics”) is concentrated on the Gödel incompleteness (1931) statement: if it is an axiom rather than a theorem inferable from the axioms of (Peano) arithmetic, (ZFC) set theory, and propositional logic, this would pioneer the pathway to Hilbert mathematics. One of the main arguments that it is an axiom consists in the direct contradiction of the axiom of induction in arithmetic and the axiom of infinity in set (...) theory. Thus, the pair of arithmetic and set are to be similar to Euclidean and non-Euclidean geometries distinguishably only by the Fifth postulate now, i.e. after replacing it and its negation correspondingly by the axiom of finiteness (induction) versus that of finiteness being idempotent negations to each other. Indeed, the axiom of choice, as far as it is equivalent to the well-ordering “theorem”, transforms any set in a well-ordering either necessarily finite according to the axiom of induction or also optionally infinite according to the axiom of infinity. So, the Gödel incompleteness statement relies on the logical contradiction of the axiom of induction and the axiom of infinity in the final analysis. Nonetheless, both can be considered as two idempotent versions of the same axiom (analogically to the Fifth postulate) and then unified after logicism and its inherent intensionality since the opposition of finiteness and infinity can be only extensional (i.e., relevant to the elements of any set rather than to the set by itself or its characteristic property being a proposition). So, the pathway for interpreting the Gödel incompleteness statement as an axiom and the originating from that assumption for “Hilbert mathematics” accepting its negation is pioneered. A much wider context relevant to realizing the Gödel incompleteness statement as a metamathematical axiom is consistently built step by step. The horizon of Hilbert mathematics is the proper subject in the third part of the paper, and a reinterpretation of Gödel’s papers (1930; 1931) as an apology of logicism as the only consistent foundations of mathematics is the topic of the next second part. (shrink)

This paper aims to contribute to the analysis of the nature of mathematical modality and hyperintensionality, and to the applications of the latter to absolute decidability. Rather than countenancing the interpretational type of mathematical modality as a primitive, I argue that the interpretational type of mathematical modality is a species of epistemic modality. I argue, then, that the framework of two-dimensional semantics ought to be applied to the mathematical setting. The framework permits of a formally precise account of the priority (...) and relation between epistemic mathematical modality and metaphysical mathematical modality. The discrepancy between the modal systems governing the parameters in the two-dimensional intensional setting provides an explanation of the difference between the metaphysical possibility of absolute decidability and our knowledge thereof. I also advance a topic-sensitive epistemic two-dimensional truthmaker semantics, if hyperintensional approaches are to be preferred to possible worlds semantics. I examine the relation between two-dimensional hyperintensional states and epistemic set theory, providing two-dimensional hyperintensional formalizations of the modal logic of ZFC, large cardinal axioms, $\Omega$-logic, and the Epistemic Church-Turing Thesis. (shrink)

The objective of this document is to present three introductory notes on set theory: The first note presents an overview of this discipline from its origins to the present, in the second note some considerations are made about the evaluation of reasoning applying the first-order Logic and Löwenheim's theorems, Church Indecidibility, Completeness and Incompleteness of Gödel, it is known that the axiomatic theories of most commonly used sets are written in a specific first-order language, that is, they are developed (...) within the framework of first-order logic, so this note is relevant; and the third note refers to the presence of mathematical platonism in the axioms of ZFC and in the axioms of "complete ordered field", it is known that the last axioms mentioned characterize (except isomorphism) the real number system and are currently used to develop the real Analysis in the context of set theory. It is hoped that this article will be of pedagogical utility for students interested in set theory and in the philosophy of mathematics (that are beginning in the subject). (shrink)

The principle of maximal entropy (further abbreviated as “MaxEnt”) can be founded on the formal mechanism, in which future transforms into past by the mediation of present. This allows of MaxEnt to be investigated by the theory of quantum information. MaxEnt can be considered as an inductive analog or generalization of “Occam’s razor”. It depends crucially on choice and thus on information just as all inductive methods of reasoning. The essence shared by Occam’s razor and MaxEnt is for the (...) relevant data known till now to be postulated as an enough fundament of conclusion. That axiom is the kind of choice grounding both principles. Popper’s falsifiability (1935) can be discussed as a complement to them: That axiom (or axiom scheme) is always sufficient but never necessary condition of conclusion therefore postulating the choice in the base of MaxEnt. Furthermore, the abstraction axiom (or axiom scheme) relevant to set theory (e.g. the axiom scheme of specification in ZFC) involves choice analogically. (shrink)

The hard problem of induction is to argue without begging the question that inductive inference, applied properly in the proper circumstances, is conducive to truth. A recent theorem seems to show that the hard problem has a deductive solution. The theorem, provable in ZFC, states that a predictive function M exists with the following property: whatever world we live in, M ncorrectly predicts the world’s present state given its previous states at all times apart from a well-ordered subset. On the (...) usual model of time a well-ordered subset is small relative to the set of all times. M’s existence therefore seems to provide a solution to the hard problem. My paper argues for two conclusions. First, the theorem does not solve the hard problem of induction. More positively though, it solves a version of the problem in which the structure of time is given modulo our choice of set theory. (shrink)

I prove that invoking the univalence axiom is equivalent to arguing 'without loss of generality' (WLOG) within Propositional Univalent Foundations (PropUF), the fragment of Univalent Foundations (UF) in which all homotopy types are mere propositions. As a consequence, I argue that practicing mathematicians, in accepting WLOG as a valid form of argument, implicitly accept the univalence axiom and that UF rightly serves as a Foundation for Mathematical Practice. By contrast, ZFC is inconsistent with WLOG as it is applied, and therefore (...) cannot serve as a foundation for practice. (shrink)

Philosophers of science since Nagel have been interested in the links between intertheoretic reduction and explanation, understanding and other forms of epistemic progress. Although intertheoretic reduction is widely agreed to occur in pure mathematics as well as empirical science, the relationship between reduction and explanation in the mathematical setting has rarely been investigated in a similarly serious way. This paper examines an important particular case: the reduction of arithmetic to set theory. I claim that the reduction is unexplanatory. In (...) defense of this claim, I offer evidence from mathematical practice, and I respond to contrary suggestions due to Steinhart, Maddy, Kitcher and Quine. I then show how, even if set-theoretic reductions are generally not explanatory, set theory can nevertheless serve as a legitimate foundation for mathematics. Finally, some implications of my thesis for philosophy of mathematics and philosophy of science are discussed. In particular, I suggest that some reductions in mathematics are probably explanatory, and I propose that differing standards of theory acceptance might account for the apparent lack of unexplanatory reductions in the empirical sciences. (shrink)

In this contribution, I explore the possibility of characterizing the emergence of time in causal set theory (CST) in terms of the growing block universe (GBU) metaphysics. I show that although GBU seems to be the most intuitive time metaphysics for CST, it leaves us with a number of interpretation problems, independently of which dynamics we choose to favor for the theory —here I shall consider the Classical Sequential Growth and the Covariant model. Discrete general covariance of the (...) CSG dynamics does not allow us to individuate a single history of the universe (defined by a causal history of different causal sets), thereby making the claim that ‘the past exists’ at best problematic. In addition, because the evolution of the universe in CSG dynamics leads to an outward branching causal tree, it becomes impossible to determine a proper ‘line of becoming’, thereby blurring the presentists’ claim that only the present exists. Similarly, the covariant approach runs into the same, if not even more severe problems, since each configuration of the universe would amount to a set of possible causal sets, thereby making the individuation of a single configuration of the universe —and thus the physical interpretation of the theory— implausible. (shrink)

Here, we analyse some recent applications of set theory to topology and argue that set theory is not only the closed domain where mathematics is usually founded, but also a flexible framework where imperfect intuitions can be precisely formalized and technically elaborated before they possibly migrate toward other branches. This apparently new role is mostly reminiscent of the one played by other external fields like theoretical physics, and we think that it could contribute to revitalize the interest in (...) set theory in the future. (shrink)

This article presents an overview of the basic philosophical motivations for, and some recent work in, modal set theory.

Consider a variant of the usual story about the iterative conception of sets. As usual, at every stage, you find all the (bland) sets of objects which you found earlier. But you also find the result of tapping any earlier-found object with any magic wand (from a given stock of magic wands). -/- By varying the number and behaviour of the wands, we can flesh out this idea in many different ways. This paper's main Theorem is that any loosely constructive (...) way of fleshing out this idea is synonymous with a ZF-like theory. -/- This Theorem has rich applications; it realizes John Conway's (1976) Mathematicians' Liberation Movement; and it connects with a lovely idea due to Alonzo Church (1974). (shrink)

In previous works, an ontology of properties for quantum mechanics has been proposed, according to which quantum systems are bundles of properties with no principle of individuality. The aim of the present article is to show that, since quasi-set theory is particularly suited for dealing with aggregates of items that do not belong to the traditional category of individual, it supplies an adequate meta-language to speak of the proposed ontology of properties and its structure.

In this paper intuitionistic set theory INC# in infinitary set theoretical language is considered. External induction principle in nonstandard intuitionistic arithmetic were derived. Non trivial application in number theory is considered.

The revival of the philosophy of mathematics in the 60s following its post-1931 slump left us with two conflicting positions on arithmetic’s ontological relationship to set theory. W.V. Quine’s view, presented in 'Word and Object' (1960), was that numbers are sets. The opposing view was advanced in another milestone of twentieth-century philosophy of mathematics, Paul Benacerraf’s 'What Numbers Could Not Be' (1965): one of the things numbers could not be, it explained, was sets; the other thing numbers could not (...) be, even more dramatically, was objects. Curiously, although Benacerraf’s article appeared in the heyday of Quine’s influence, it declined to engage the Quinean position squarely, even seemed to think it was not its business to do so. Despite that, in my experience, most philosophers believe that Benacerraf’s article put paid to the reductionist view that numbers are sets (though perhaps not the view that numbers are objects). My chapter will attempt to overturn this orthodoxy. (shrink)

An attempt to vindicate naive set theory by postulating a universal set V which is describable in two distinct description languages: predicative and extensional. The extensional description of a set consists of describing all its elements whereas its predicative description consists of describing what sets it is an element of. -/- Extensionally described V has an uncapturable description length, akin to its cardinality. But predicatively described, in virtue of being the set that is not contained in any set whatsoever, (...) V has a minimal description length, a counterbalance to its cardinality. -/- Descriptive efficiency can genuinely be attributed to V (achieved in a third description language) only if it contains predicatively indiscernible but extensionally discernible sets. (shrink)

Set-theoretic and category-theoretic foundations represent different perspectives on mathematical subject matter. In particular, category-theoretic language focusses on properties that can be determined up to isomorphism within a category, whereas set theory admits of properties determined by the internal structure of the membership relation. Various objections have been raised against this aspect of set theory in the category-theoretic literature. In this article, we advocate a methodological pluralism concerning the two foundational languages, and provide a theory that fruitfully interrelates (...) a ‘structural’ perspective to a set-theoretic one. We present a set-theoretic system that is able to talk about structures more naturally, and argue that it provides an important perspective on plausibly structural properties such as cardinality. We conclude the language of set theory can provide useful information about the notion of mathematical structure. (shrink)

In the paper we will employ set theory to study the formal aspects of quantum mechanics without explicitly making use of space-time. It is demonstrated that von Neuman and Zermelo numeral sets, previously efectively used in the explanation of Hardy’s paradox, follow a Heisenberg quantum form. Here monadic union plays the role of time derivative. The logical counterpart of monadic union plays the part of the Hamiltonian in the commutator. The use of numerals and monadic union in the classical (...) probability resolution of Hardy’s paradox [1] is supported with the present derivation of a commutator for sets. (shrink)

The original purpose of the present study, 2011, started with a preprint «On the Probable Failure of the Uncountable Power Set Axiom», 1988, 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’être of all traditional set-theoretical enterprises to Infinity and beyond, from Georg Cantor to David Hilbert to Kurt Gödel to W. Hugh Woodin to Buzz Lightyear.

Cognitive Set Theory is a mathematical model of cognition which equates sets with concepts, and uses mereological elements. It has a holistic emphasis, as opposed to a reductionistic emphasis, and it therefore begins with a single universe (as opposed to an infinite collection of infinitesimal points).

Main results are: (i) number e^{e} is transcendental; (ii) the both numbers e+π and e-π are irrational.

Set-theoretic and category-theoretic foundations represent different perspectives on mathematical subject matter. In particular, category-theoretic language focusses on properties that can be determined up to isomorphism within a category, whereas set theory admits of properties determined by the internal structure of the membership relation. Various objections have been raised against this aspect of set theory in the category-theoretic literature. In this article, we advocate a methodological pluralism concerning the two foundational languages, and provide a theory that fruitfully interrelates (...) a `structural' perspective to a set-theoretic one. We present a set-theoretic system that is able to talk about structures more naturally, and argue that it provides an important perspective on plausibly structural properties such as cardinality. We conclude the language of set theory can provide useful information about the notion of mathematical structure. (shrink)

A possible world is a junky world if and only if each thing in it is a proper part. The possibility of junky worlds contradicts the principle of general fusion. Bohn (2009) argues for the possibility of junky worlds, Watson (2010) suggests that Bohn‘s arguments are flawed. This paper shows that the arguments of both authors leave much to be desired. First, relying on the classical results of Cantor, Zermelo, Fraenkel, and von Neumann, this paper proves the possibility of junky (...) worlds for certain weak set theories. Second, the paradox of Burali-Forti shows that according to the Zermelo-Fraenkel set theory ZF, junky worlds are possible. Finally, it is shown that set theories are not the only sources for designing plausible models of junky worlds: Topology (and possibly other "algebraic" mathematical theories) may be used to construct models of junky worlds. In sum, junkyness is a relatively widespread feature among possible worlds. (shrink)

The notion of equality between two observables will play many important roles in foundations of quantum theory. However, the standard probabilistic interpretation based on the conventional Born formula does not give the probability of equality between two arbitrary observables, since the Born formula gives the probability distribution only for a commuting family of observables. In this paper, quantum set theory developed by Takeuti and the present author is used to systematically extend the standard probabilistic interpretation of quantum (...) class='Hi'>theory to define the probability of equality between two arbitrary observables in an arbitrary state. We apply this new interpretation to quantum measurement theory, and establish a logical basis for the difference between simultaneous measurability and simultaneous determinateness. (shrink)

The merits of set theory as a foundational tool in mathematics stimulate its use in various areas of artificial intelligence, in particular intelligent information systems. In this paper, a study of various nonstandard treatments of set theory from this perspective is offered. Applications of these alternative set theories to information or knowledge management are surveyed.

This paper presents and defends an argument that the continuum hypothesis is false, based on considerations about objective chance and an old theorem due to Banach and Kuratowski. More specifically, I argue that the probabilistic inductive methods standardly used in science presuppose that every proposition about the outcome of a chancy process has a certain chance between 0 and 1. I also argue in favour of the standard view that chances are countably additive. Since it is possible to randomly pick (...) out a point on a continuum, for instance using a roulette wheel or by flipping a countable infinity of fair coins, it follows, given the axioms of ZFC, that there are many different cardinalities between countable infinity and the cardinality of the continuum. (shrink)

Instead of the half-century old foundational feud between set theory and category theory, this paper argues that they are theories about two different complementary types of universals. The set-theoretic antinomies forced naïve set theory to be reformulated using some iterative notion of a set so that a set would always have higher type or rank than its members. Then the universal u_{F}={x|F(x)} for a property F() could never be self-predicative in the sense of u_{F}∈u_{F}. But the mathematical (...) theory of categories, dating from the mid-twentieth century, includes a theory of always-self-predicative universals--which can be seen as forming the "other bookend" to the never-self-predicative universals of set theory. The self-predicative universals of category theory show that the problem in the antinomies was not self-predication per se, but negated self-predication. They also provide a model (in the Platonic Heaven of mathematics) for the self-predicative strand of Plato's Theory of Forms as well as for the idea of a "concrete universal" in Hegel and similar ideas of paradigmatic exemplars in ordinary thought. (shrink)

In this book set theory INC# based on intuitionistic logic with restricted modus ponens rule is proposed. It proved that intuitionistic logic with restricted modus ponens rule can to safe Cantor naive set theory from a triviality.

This paper analyses the hidden use of new axioms in set-theoretic practice with a focus on large cardinal axioms and presents a general overview of set-theoretic practices using large cardinal axioms. The hidden use of a new axiom provides extrinsic reasons in support of this axiom via the idea of verifiable consequences, which is especially relevant for set-theoretic practitioners with an absolutist view. Besides that, the hidden use has pragmatic significance for further important sub-groups of the set-theoretic community---set-theoretic practitioners with (...) a pluralist view and set-theoretic practitioners who aim for ZFC-proofs. By describing this, the paper gives a more complete picture of new axioms in set-theoretic practice. These observations, for instance, show that set-theoretic practitioners interested in ZFC-proofs use tools that go beyond ZFC. The analysis is based on empirical data that was collected in an extensive interview study with set-theoretic practitioners. (shrink)

The success of set theory as a foundation for mathematics inspires its use in artificial intelligence, particularly in commonsense reasoning. In this survey, we briefly review classical set theory from an AI perspective, and then consider alternative set theories. Desirable properties of a possible commonsense set theory are investigated, treating different aspects like cumulative hierarchy, self-reference, cardinality, etc. Assorted examples from the ground-breaking research on the subject are also given.

In this article Russell’s paradox and Cantor’s paradox resolved successfully using intuitionistic logic with restricted modus ponens rule.

The purpose of this paper is to introduce new types of neutrosophic crisp sets with three types 1, 2, 3. After given the fundamental definitions and operations, we obtain several properties, and discussed the relationship between neutrosophic crisp sets and others. Also, we introduce and study the neutrosophic crisp point and neutrosophic crisp relations. Possible applications to database are touched upon.