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)

The focus in this essay will be upon the paradoxes, and foremostly in set theory. A central result is that the librationist set theory £ extension \Pfund $\mathscr{HR}(\mathbf{D})$ of \pounds \ accounts for \textbf{Neumann-Bernays-Gödel} set theory with the \textbf{Axiom of Choice} and \textbf{Tarski's Axiom}. Moreover, \Pfund \ succeeds with defining an impredicative manifestation set $\mathbf{W}$, \emph{die Welt}, so that \Pfund$\mathscr{H}(\mathbf{W})$ %is a model accounts for Quine's \textbf{New Foundations}. Nevertheless, the points of view developed support the view (...) that the truth-paradoxes and the set-paradoxes have common origins, so that the librationist resolutions of the set theoretic paradoxes are at the same time resolutions of the truth theoretic paradoxes. Both the librationist resolutions of the set theoretic paradoxes and the truth theoretic paradoxes have non-trivial philosophical implications: librationist set theories have the consequence that there are no absolutely uncountable sets, and librationist truth theories allow the use of syntactical modalities in ways which circumvent limitations as those of \parencite{Montague1963}, and a truth predicate which is useful for more precise philosophical discourse. (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 (...) class='Hi'>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)

Hilary Putnam's famous arguments criticizing Tarski's theory of truth are evaluated. It is argued that they do not succeed to undermine Tarski's approach. One of the arguments is based on the problematic idea of a false instance of T-schema. The other ignores various issues essential for Tarski's setting such as language-relativity of truth definition.

In the early 20th century, scepticism was common among philosophers about the very meaningfulness of the notion of truth – and of the related notions of denotation, definition etc. (i.e., what Tarski called semantical concepts). Awareness was growing of the various logical paradoxes and anomalies arising from these concepts. In addition, more philosophical reasons were being given for this aversion.1 The atmosphere changed dramatically with Alfred Tarski’s path-breaking contribution. What Tarski did was to show that, assuming that (...) the syntax of the object language is specified exactly enough, and that the metatheory has a certain amount of set theoretic power,2 one can explicitly define truth in the object language. And what can be explicitly defined can be eliminated. It follows that the defined concept cannot give rise to any inconsistencies (that is, paradoxes). This gave new respectability to the concept of truth and related notions. Nevertheless, philosophers’ judgements on the nature and philosophical relevance of Tarski’s work have varied. It is my aim here to review and evaluate some threads in this debate. (shrink)

Alfred Tarski (1901--1983) is widely regarded as one of the two giants of twentieth-century logic and also as one of the four greatest logicians of all time (Aristotle, Frege and Gödel being the other three). Of the four, Tarski was the most prolific as a logician. The four volumes of his collected papers, which exclude most of his 19 monographs, span over 2500 pages. Aristotle's writings are comparable in volume, but most of the Aristotelian corpus is not about (...) logic, whereas virtually everything written by Tarski concerns logic more or less directly. There is no doubt that Tarski wrote more on logic than any other author; he started publishing on logic in 1921 at the age of 20 and continued until his death at the age of 82. Two of his works appeared posthumously [Hist. Philos. Logic 7 (1986), no. 2, 143--154; MR0868748 (88b:03010); Tarski and Givant, A formalization of set theory without variables, Amer. Math. Soc., Providence, RI, 1987; MR0920815 (89g:03012)]. Tarski's voluminous writings were widely scattered in numerous journals, some quite rare. It has been extremely difficult to study the development of Tarski's thought and to trace the interconnections and interdependence of his various papers. Thanks to the present collection all this has changed, and it is likely that the increased accessibility of Tarski's papers will have the effect of increasing Tarski's already enormous influence. (shrink)

In his seminal work “The Concept of Truth in Formalized Languages”, Alfred Tarski showed how to construct a formally correct and materially adequate definition of true sentence for certain formalized languages. These results have, eventually, been accepted and applauded by philosophers and logicians nearly in unison. Its Postscript, written two years later, however, has given rise to a considerable amount of controversy. There is an ongoing debate on what Tarski really said in the postscript. These discussions often regard (...) Tarski as putatively changing his logical framework from type theory to set theory. In what follows, we will compare the original results with those presented two years later. After a brief outline of Carnap’s program in The Logical Syntax of Language we will determine its significance for Tarski’s final results. (shrink)

The period from 1900 to 1935 was particularly fruitful and important for the development of logic and logical metatheory. This survey is organized along eight "itineraries" concentrating on historically and conceptually linked strands in this development. Itinerary I deals with the evolution of conceptions of axiomatics. Itinerary II centers on the logical work of Bertrand Russell. Itinerary III presents the development of set theory from Zermelo onward. Itinerary IV discusses the contributions of the algebra of logic tradition, in particular, (...) Löwenheim and Skolem. Itinerary V surveys the work in logic connected to the Hilbert school, and itinerary V deals specifically with consistency proofs and metamathematics, including the incompleteness theorems. Itinerary VII traces the development of intuitionistic and many-valued logics. Itinerary VIII surveys the development of semantical notions from the early work on axiomatics up to Tarski's work on truth. (shrink)

The word ‘equality’ often requires disambiguation, which is provided by context or by an explicit modifier. For each sort of magnitude, there is at least one sense of ‘equals’ with its correlated senses of ‘is greater than’ and ‘is less than’. Given any two magnitudes of the same sort—two line segments, two plane figures, two solids, two time intervals, two temperature intervals, two amounts of money in a single currency, and the like—the one equals the other or the one is (...) greater than the other or the one is greater than the other [sc. in appropriate correlated senses of ‘equals’, ‘is greater than’ and ‘is less than’]. In case there are two or more appropriate senses of ‘equals’, the one intended is often indicated by an adverb. For example, one plane figure may be said to be equal in area to another and, in certain cases, one plane figure may be said to be equal in length to another. Each sense of ‘equality’ is tied to a specific domain and is therefore non-logical. Notice that in every cases ‘equality’ is definable in terms of ‘is greater than’ and also in terms of ‘is less than’ both of which are routinely considered domain specific, non-logical. The word ‘identity’ in the logical sense does not require disambiguation. Moreover, it is not correlated ‘is greater than’ and ‘is less than’. If it is not the case that a certain designated triangle is [sc. is identical to] an otherwise designated triangle, it is not necessary for the one to be greater than or less than the other. Moreover, if two magnitudes are equal then a unit of measure can be chosen and, no matter what unit is chosen, each magnitude is the same multiple of the unit that the other is. But identity does not require units. In this regard, congruence is like identity and unlike equality. In arithmetic, the logical concept of identity is coextensive with the arithmetic concept of equality. The logical concept of identity admits of an analytically adequate definition in terms of logical concepts: given any number x and any number y, x is y iff x has every property that y has. The arithmetical concept of equality admits of an analytically adequate definition in terms of arithmetical concepts: given any number x and any number y, x equals y iff x is neither less than nor greater than y. As Aristotle told us and as Frege retold us, just because one relation is coextensive with another is no reason to conclude that they are one. (shrink)

Gila Sher interviewed by Chen Bo: -/- I. Academic Background and Earlier Research: 1. Sher’s early years. 2. Intellectual influence: Kant, Quine, and Tarski. 3. Origin and main Ideas of The Bounds of Logic. 4. Branching quantifiers and IF logic. 5. Preparation for the next step. -/- II. Foundational Holism and a Post-Quinean Model of Knowledge: 1. General characterization of foundational holism. 2. Circularity, infinite regress, and philosophical arguments. 3. Comparing foundational holism and foundherentism. 4. A post-Quinean model of (...) knowledge. 5. Intellect and figuring out. 6. Comparing foundational holism with Quine’s holism. 7. Evaluation of Quine’s Philosophy -/- III. Substantive Theory of Truth and Relevant Issues: 1. Outline of Sher’s substantive theory of truth. 2. Criticism of deflationism and treatment of the Liar. 3. Comparing Sher’s substantive theory of truth with Tarski’s theory of truth. -/- IV. A New Philosophy of Logic and Comparison with Other Theories: 1. Foundational account of logic. 2. Standard of logicality, set theory and logic. 3. Psychologism, Hanna’s and Maddy’s conceptions of logic. 4. Quine’s theses about the revisability of logic. -/- V. Epilogue. (shrink)

This essay endeavors to define the concept of indefinite extensibility in the setting of category theory. I argue that the generative property of indefinite extensibility for set-theoretic truths in category theory is identifiable with the Grothendieck Universe Axiom and the elementary embeddings in Vopenka's principle. The interaction between the interpretational and objective modalities of indefinite extensibility is defined via the epistemic interpretation of two-dimensional semantics. The semantics can be defined intensionally or hyperintensionally. By characterizing the modal profile (...) of $\Omega$-logical validity, and thus the generic invariance of mathematical truth, modal coalgebras are further capable of capturing the notion of definiteness for set-theoretic truths, in order to yield a non-circular definition of indefinite extensibility. (shrink)

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

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)

This chapter argues that Davidson's truth-theoretic semantics was not intended to replace the traditional pursuit of providing a compositional meaning theory but rather to achieve the same aim indirectly by placing conditions on a truth theory that would enable someone who understood it to understand its object language. The chapter argues that by placing constraints on the axioms of a Tarski-style truth theory, namely, that they interpret the terms for which they give satisfaction conditions, and specifying (...) a suitable canonical proof procedure that issues in T-sentence that remove all the metalanguage semantic terms from the right hand side and draw intuitively only on the content of the axioms, we can use the theory to interpret object language sentences. It further argues that if we ask what body of knowledge one must be in possession of to interpret the language, it turns out to be a set of propositions about the truth theory but not the axioms of the truth theory itself. This shows how to avoid the problem of the semantic paradoxes and the problem of vagueness. (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)

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)

Tarski's indefinability theorem shows us that truth is not definable in arithmetic. The requirement to define truth for a language in a stronger language (if contradiction is to be avoided) lapses for particularly weak languages. A weaker language, however, is not necessary for that lapse. It also lapses for an adequately weak theory. It turns out that the set of G{\"o}del numbers of sentences true in arithmetic modulo $n$ is definable in arithmetic modulo $n$.

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)

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.

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)

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)

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)

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. Similar results for paraconsistent set theories were obtained in author papers [13]-[16].

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.

This is a chapter of the planned monograph "Out of Nowhere: The Emergence of Spacetime in Quantum Theories of Gravity", co-authored by Nick Huggett and Christian Wüthrich and under contract with Oxford University Press. (More information at www<dot>beyondspacetime<dot>net.) This chapter introduces causal set theory and identifies and articulates a 'problem of space' in this theory.

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 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 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).

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)

The link between the high-order metaphysics and abstractions, on the one hand, and choice in the foundation of set theory, on the other hand, can distinguish unambiguously the “good” principles of abstraction from the “bad” ones and thus resolve the “bad company problem” as to set theory. Thus it implies correspondingly a more precise definition of the relation between the axiom of choice and “all company” of axioms in set theory concerning directly or indirectly abstraction: the principle (...) of abstraction, axiom of comprehension, axiom scheme of specification, axiom scheme of separation, subset axiom scheme, axiom scheme of replacement, axiom of unrestricted comprehension, axiom of extensionality, etc. (shrink)

The concepts of choice, negation, and infinity are considered jointly. The link is the quantity of information interpreted as the quantity of choices measured in units of elementary choice: a bit is an elementary choice between two equally probable alternatives. “Negation” supposes a choice between it and confirmation. Thus quantity of information can be also interpreted as quantity of negations. The disjunctive choice between confirmation and negation as to infinity can be chosen or not in turn: This corresponds to set- (...) class='Hi'>theory or intuitionist approach to the foundation of mathematics and to Peano or Heyting arithmetic. Quantum mechanics can be reformulated in terms of information introducing the concept and quantity of quantum information. A qubit can be equivalently interpreted as that generalization of “bit” where the choice is among an infinite set or series of alternatives. The complex Hilbert space can be represented as both series of qubits and value of quantum information. The complex Hilbert space is that generalization of Peano arithmetic where any natural number is substituted by a qubit. “Negation”, “choice”, and “infinity” can be inherently linked to each other both in the foundation of mathematics and quantum mechanics by the meditation of “information” and “quantum information”. (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)

In this book the authors introduce and study the following notions: Neutrosophic Crisp Points, Neutrosophic Crisp Relations, Neutrosophic Crisp Sets, Neutrosophic Set Generated by (Characteristic Function), alpha-cut Level for Neutrosophic Sets, Neutrosophic Crisp Continuous Function, Neutrosophic Crisp Compact Spaces, Neutrosophic Crisp Nearly Open Sets, Neutrosophic Crisp Ideals, Neutrosophic Crisp Filter, Neutrosophic Crisp Local Functions, Neutrosophic Crisp Sets via Neutrosophic Crisp Ideals, Neutrosophic Crisp L-Openness and Neutrosophic Crisp L-Continuity, Neutrosophic Topological Region, Neutrosophic Closed Set and Neutrosophic Continuous Function, etc. They compute (...) the distances between neutrosophic sets and extend it to Neutrosophic Hesitancy Degree. The authors also generalize the Crisp Topological Space and Intuitionistic Topological Space to the notion of Neutrosophic Crisp Topological Space. At the end, they present applications to Neutrosophic Database, and show a security scheme based on Public Key Infrastructure (PKI) using Neutrosophic Logic Manipulation. The authors utilize neutrosophic sets in order to analyze social networks data conducted through learning activities, and for the Geographical Information Systems (GIS) they employ fundamental concepts and properties of a Neutrosophic Spatial Region. Keywords: Neutrosophic Crisp Points; Neutrosophic Crisp Relations; Neutrosophic Crisp Sets; Neutrosophic Crisp Continuous Function; Neutrosophic Crisp Compact Spaces; Neutrosophic Crisp Nearly Open Sets; Neutrosophic Crisp Ideals; Neutrosophic Crisp Filter; Neutrosophic Crisp Local Functions; Neutrosophic Crisp Sets via Neutrosophic Crisp Ideals; Neutrosophic Crisp L-Openness and Neutrosophic Crisp L-Continuity; Neutrosophic Topological Region; Neutrosophic Closed Set and Neutrosophic Continuous Function; Neutrosophic Hesitancy Degree; Neutrosophic Crisp Topological Space; Neutrosophic Database; Neutrosophic Logic Manipulation; Neutrosophic Spatial Region. (shrink)

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

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.

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)

A practical viewpoint links reality, representation, and language to calculation by the concept of Turing (1936) machine being the mathematical model of our computers. After the Gödel incompleteness theorems (1931) or the insolvability of the so-called halting problem (Turing 1936; Church 1936) as to a classical machine of Turing, one of the simplest hypotheses is completeness to be suggested for two ones. That is consistent with the provability of completeness by means of two independent Peano arithmetics discussed in Section I. (...) Many modifications of Turing machines cum quantum ones are researched in Section II for the Halting problem and completeness, and the model of two independent Turing machines seems to generalize them. Then, that pair can be postulated as the formal definition of reality therefore being complete unlike any of them standalone, remaining incomplete without its complementary counterpart. Representation is formal defined as a one-to-one mapping between the two Turing machines, and the set of all those mappings can be considered as “language” therefore including metaphors as mappings different than representation. Section III investigates that formal relation of “reality”, “representation”, and “language” modeled by (at least two) Turing machines. The independence of (two) Turing machines is interpreted by means of game theory and especially of the Nash equilibrium in Section IV. Choice and information as the quantity of choices are involved. That approach seems to be equivalent to that based on set theory and the concept of actual infinity in mathematics and allowing of practical implementations. (shrink)

As analytic philosophy is becoming increasingly aware of and interested in its own history, the study of that field is broadening to include, not just its earliest beginnings, but also the mid-twentieth century. One of the towering figures of this epoch is W.V. Quine (1908-2000), champion of naturalism in philosophy of science, pioneer of mathematical logic, trying to unite an austerely physicalist theory of the world with the truths of mathematics, psychology, and linguistics. Quine's posthumous papers, notes, and drafts (...) revealing the development of his views in the forties have recently begun to be published, as well as careful philosophical studies of, for instance, the evolution of his key doctrine that mathematical and logical truth are continuous with, not divorced from, the truths of natural science. But one central text has remained unexplored: Quine's Portuguese-language book on logic, his 'farewell for now' to the discipline as he embarked on an assignment in the Navy in WWII. Anglophone philosophers have neglected this book because they could not read it. Jointly with colleagues, I have completed the first full English translation of this book. In this accompanying paper I draw out the main philosophical contributions Quine made in the book, placing them in their historical context and relating them to Quine's overall philosophical development during the period. Besides significant developments in the evolution of Quine's views on meaning and analyticity, I argue, this book is also driven by Quine's indebtedness to Russell and Whitehead, Tarski, and Frege, and contains crucial developments in his thinking on philosophy of logic and ontology. This includes early versions of some arguments from 'On What There Is', four-dimensionalism, and virtual set theory. (shrink)

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.

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.

Relevance logic has become ontologically fertile. No longer is the idea of relevance restricted in its application to purely logical relations among propositions, for as Dunn has shown in his (1987), it is possible to extend the idea in such a way that we can distinguish also between relevant and irrelevant predications, as for example between “Reagan is tall” and “Reagan is such that Socrates is wise”. Dunn shows that we can exploit certain special properties of identity within the context (...) of standard relevance logic in a way which allows us to discriminate further between relevant and irrelevant properties, as also between relevant and irrelevant relations. The idea yields a family of ontologically interesting results concerning the different ways in which attributes and objects may hang together. Because of certain notorious peculiarities of relevance logic, however,1 Dunn’s idea breaks down where the attempt is made to have it bear fruit in application to relations among entities which are of homogeneous type. (shrink)

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

DEFINING OUR TERMS A “paradox" is an argumentation that appears to deduce a conclusion believed to be false from premises believed to be true. An “inconsistency proof for a theory" is an argumentation that actually deduces a negation of a theorem of the theory from premises that are all theorems of the theory. An “indirect proof of the negation of a hypothesis" is an argumentation that actually deduces a conclusion known to be false from the hypothesis alone (...) or, more commonly, from the hypothesis augmented by a set of premises known to be true. A “direct proof of a hypothesis" is an argumentation that actually deduces the hypothesis itself from premises known to be true. Since `appears', `believes' and `knows' all make elliptical reference to a participant, it is clear that `paradox', `indirect proof' and `direct proof' are all participant-relative. PARTICIPANT RELATIVITY In normal mathematical writing the participant is presumed to be “the community of mathematicians" or some more or less well-defined subcommunity and, therefore, omission of explicit reference to the participant is often warranted. However, in historical, critical, or philosophical writing focused on emerging branches of mathematics such omission often invites confusion. One and the same argumentation has been a paradox for one mathematician, an inconsistency proof for another, and an indirect proof to a third. One and the same argumentation-text can appear to one mathematician to express an indirect proof while appearing to another mathematician to express a direct proof. WHAT IS A PARADOX’S SOLUTION? Of the above four sorts of argumentation only the paradox invites “solution" or “resolution", and ordinarily this is to be accomplished either by discovering a logical fallacy in the “reasoning" of the argumentation or by discovering that the conclusion is not really false or by discovering that one of the premises is not really true. Resolution of a paradox by a participant amounts to reclassifying a formerly paradoxical argumentation either as a “fallacy", as a direct proof of its conclusion, as an indirect proof of the negation of one of its premises, as an inconsistency proof, or as something else depending on the participant's state of knowledge or belief. This illustrates why an argumentation which is a paradox to a given mathematician at a given time may well not be a paradox to the same mathematician at a later time. -/- The present article considers several set-theoretic argumentations that appeared in the period 1903-1908. The year 1903 saw the publication of B. Russell's Principles of mathematics, [Cambridge Univ. Press, Cambridge, 1903; Jbuch 34, 62]. The year 1908 saw the publication of Russell's article on type theory as well as Ernst Zermelo's two watershed articles on the axiom of choice and the foundations of set theory. The argumentations discussed concern “the largest cardinal", “the largest ordinal", the well-ordering principle, “the well-ordering of the continuum", denumerability of ordinals and denumerability of reals. The article shows that these argumentations were variously classified by various mathematicians and that the surrounding atmosphere was one of confusion and misunderstanding, partly as a result of failure to make or to heed distinctions similar to those made above. The article implies that historians have made the situation worse by not observing or not analysing the nature of the confusion. -/- RECOMMENDATION This well-written and well-documented article exemplifies the fact that clarification of history can be achieved through articulation of distinctions that had not been articulated (or were not being heeded) at the time. The article presupposes extensive knowledge of the history of mathematics, of mathematics itself (especially set theory) and of philosophy. It is therefore not to be recommended for casual reading. AFTERWORD: This review was written at the same time Corcoran was writing his signature “Argumentations and logic”[249] that covers much of the same ground in much more detail. https://www.academia.edu/14089432/Argumentations_and_Logic . (shrink)

ABSTRACT Theories of sets such as Zermelo Fraenkel set theory are usually presented as the combination of two distinct kinds of principles: logical and set-theoretic principles. The set-theoretic principles are imposed ‘on top’ of first-order logic. This is in agreement with a traditional view of logic as universally applicable and topic neutral. Such a view of logic has been rejected by the intuitionists, on the ground that quantification over infinite domains requires the use of intuitionistic rather than classical logic. (...) In the following, I consider constructive set theories, which use intuitionistic rather than classical logic, and argue that they manifest a distinctive interdependence or an entanglement between sets and logic. In fact, Martin-Löf type theory identifies fundamental logical and set-theoretic notions. Remarkably, one of the motivations for this identification is the thought that classical quantification over infinite domains is problematic, while intuitionistic quantification is not. The approach to quantification adopted in Martin-Löf’s type theory is subtly interconnected with its predicativity. I conclude by recalling key aspects of an approach to predicativity inspired by Poincaré, which focuses on the issue of correct quantification over infinite domains and relate it back to Martin-Löf type theory. (shrink)

In the contemporary philosophy of set theory, discussion of new axioms that purport to resolve independence necessitates an explanation of how they come to be justified. Ordinarily, justification is divided into two broad kinds: intrinsic justification relates to how `intuitively plausible' an axiom is, whereas extrinsic justification supports an axiom by identifying certain `desirable' consequences. This paper puts pressure on how this distinction is formulated and construed. In particular, we argue that the distinction as often presented is neither well-demarcated (...) nor sufficiently precise. Instead, we suggest that the process of justification in set theory should not be thought of as neatly divisible in this way, but should rather be understood as a conceptually indivisible notion linked to the goal of explanation. (shrink)

This article develops a criticism of Alain Badiou’s assertion that “mathematics is ontology.” I argue that despite appearances to the contrary, Badiou’s case for bringing set theory and ontology together is problematic. To arrive at this judgment, I explore how a case for the identification of mathematics and ontology could work. In short, ontology would have to be characterised to make it evident that set theory can contribute to it fundamentally. This is indeed how Badiou proceeds in Being (...) and Event. I review his descriptions of the ontological problematic at some length here, only to argue that set theory is a poor fit. Although philosophers working on questions of being were certainly occupied with matters of oneness and the part-whole relationship, I argue that Badiou’s discussion of philosophical sources points towards a mereological treatment, not a set-theoretic one. Finally, I suggest that Badiou’s philosophical interpretations of key set-theoretic results are better understood as some sort of analogising between mathematics, ontology, and philosophical anthropology. (shrink)