Set-Theoretic Constructions

In the late 1940s and early 1950s Lorenzen developed his operative logic and mathematics, a form of constructive mathematics. Nowadays this is mostly seen as the precursor to the more well-known dialogical logic and one could assumed that the same philosophical motivations were present in both works. However we want to show that this is not always the case. In particular, we claim, that Lorenzen’s well-known rejection of the actual infinite as stated in Lorenzen (1957) was not a major motivation (...) for operative logic and mathematics. In this article, we claim that this is in fact not the case. Rather, we argue for a shift that happened in Lorenzen’s treatment of the infinite from the early to the late 1950s. His early motivation for the development of operativism is concerned with a critique of the Cantorian notion of set and related questions about the notion of countability and uncountability; only later, his motivation switches to focusing on the concept of infinity and the debate about actual and potential infinity. (shrink)

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

A central area of current philosophical debate in the foundations of mathematics concerns whether or not there is a single, maximal, universe of set theory. Universists maintain that there is such a universe, while Multiversists argue that there are many universes, no one of which is ontologically privileged. Often model-theoretic constructions that add sets to models are cited as evidence in favour of the latter. This paper informs this debate by developing a way for a Universist to interpret talk that (...) seems to necessitate the addition of sets to V. We argue that, despite the prima facie incoherence of such talk for the Universist, she nonetheless has reason to try and provide interpretation of this discourse. We present a method of interpreting extension-talk (V-logic), and show how it captures satisfaction in `ideal' outer models and relates to impredicative class theories. We provide some reasons to regard the technique as philosophically virtuous, and argue that it opens new doors to philosophical and mathematical discussions for the Universist. (shrink)

A homeomorphism is built between the separable complex Hilbert space (quantum mechanics) and Minkowski space (special relativity) by meditation of quantum information (i.e. qubit by qubit). That homeomorphism can be interpreted physically as the invariance to a reference frame within a system and its unambiguous counterpart out of the system. The same idea can be applied to Poincaré’s conjecture (proved by G. Perelman) hinting at another way for proving it, more concise and meaningful physically. Furthermore, the conjecture can be generalized (...) and interpreted in relation to the pseudo-Riemannian space of general relativity therefore allowing for both mathematical and philosophical interpretations of the force of gravitation due to the mismatch of choice and ordering and resulting into the “curving of information” (e.g. entanglement). Mathematically, that homeomorphism means the invariance to choice, the axiom of choice, well-ordering, and well-ordering “theorem” (or “principle”) and can be defined generally as “information invariance”. Philosophically, the same homeomorphism implies transcendentalism once the philosophical category of the totality is defined formally. The fundamental concepts of “choice”, “ordering” and “information” unify physics, mathematics, and philosophy and should be related to their shared foundations. (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-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)

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)

In this article, we analyse the ontological import of adding classes to set theories. We assume that this increment is well represented by going from ZF system to NBG. We thus consider the standard techniques of reducing one system to the other. Novak proved that from a model of ZF we can build a model of NBG (and vice versa), while Shoenfield have shown that from a proof in NBG of a set-sentence we can generate a proof in ZF of (...) the same formula. We argue that the first makes use of a too strong metatheory. Although meaningful, this symmetrical reduction does not equate the ontological content of the theories. The strong metatheory levels the two theories. Moreover, we will modernize Shoenfields proof, emphasizing its relation to Herbrands theorem and that it can only be seen as a partial type of reduction. In contrast with symmetrical reductions, we believe that asymmetrical relations are powerful tools for comparing ontological content. In virtue of this, we prove that there is no interpretation of NBG in ZF, while NBG trivially interprets ZF. This challenges the standard view that the two systems have the same ontological content. (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)

Peano arithmetic cannot serve as the ground of mathematics for it is inconsistent to infinity, and infinity is necessary for its foundation. Though Peano arithmetic cannot be complemented by any axiom of infinity, there exists at least one (logical) axiomatics consistent to infinity. That is nothing else than a new reading at issue and comparative interpretation of Gödel’s papers (1930; 1931) meant here. Peano arithmetic admits anyway generalizations consistent to infinity and thus to some addable axiom(s) of infinity. The most (...) utilized example of those generalizations is the complex Hilbert space. Any generalization of Peano arithmetic consistent to infinity, e.g. the complex Hilbert space, can serve as a foundation for mathematics to found itself and by itself. (shrink)

This paper briefly traces the evolution of the function concept until its modern set theoretic definition, and then investigates its relationship to the pre-formal notion of variable dependence. I shall argue that the common association of pre-formal dependence with the modern function concept is misconceived, and that two different notions of dependence are actually involved in the classic and the modern viewpoints, namely effective and functional dependence. The former contains the latter, and seems to conform more to our pre-formal conception (...) of dependence. The idea of effective dependence is further investigated in connection with the notions of function content and intensionality. Finally, the relevance of the distinction between the two kinds of dependence to mathematical practice is considered. (shrink)

In his ontological works Kurt Grelling tries to give a rigorous analysis of the foundations of the so-called Gestalt-psychology. Gestalten are peculiar emergent qualities, ontologically dependent on their foundations, but nonetheless non reducible to them. Grelling shows that this concept, as used in psychology and ontology, is often ambiguous. He distinguishes two important meanings in which the word “Gestalt” is used: Gestalten as structural aspects available to transposition and Gestalten as causally self-regulating wholes. Gestalten in the first meaning are, according (...) to Grelling, “equivalence classes of correspondences”, while Gestalten as self-regulating wholes have more to do with relations of ontological dependence. Grelling’s clarification of the concept of Gestalt is doubtless an excellent piece of philosophical analysis, but at the end of the day it turns out that his analysis captures at best only a part of intuitions traditionally connected with the notion of Gestalt. (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)

Constructive set theory a' la Myhill-Aczel has been extended in (Cantini and Crosilla 2008, Cantini and Crosilla 2010) to incorporate a notion of (partial, non--extensional) operation. Constructive operational set theory is a constructive and predicative analogue of Beeson's Inuitionistic set theory with rules and of Feferman's Operational set theory (Beeson 1988, Feferman 2006, Jaeger 2007, Jaeger 2009, Jaeger 1009b). This paper is concerned with an extension of constructive operational set theory (Cantini and Crosilla 2010) by a uniform operation of Transitive (...) Closure, \tau. Given a set a, \tau produces its transitive closure \tau a. We show that the theory ESTE of (Cantini and Crosilla 2010) augmented by \tau is still conservative over Peano Arithmetic. (shrink)

Philosophy of science in the 20th century is to be considered as mostly characterized by a fundamentally systematic heuristic attitude, which looks to mathematics, and more generally to the philosophy of mathematics, for a genuinely and epistemologically legitimate form of knowledge. Rooted in this assumption, the book provides a formal reconsidering of the dynamics of scientific theories, especially in the field of the physical sciences, and offers a significant contribution to current epistemological investigations regarding the validity of using formal (especially: (...) model-theoretic) methods of analysis, as developed principally by Stegmüller, Sneed, Suppes, Moulines, “to bring the airy flights of analytical philosophy back down to earth”, to borrow Stephan Hartmann’s provocative statement. At the same time, the volume represents a comprehensive account of the epistemic content of physical theories, the logic of theory change in science, and specific (inter-)theoretical core aspects of scientific progress, particularly in the form suggested informally by Thomas Kuhn. As C. Ulises Moulines writes in the preface, “there is no other example in present-day literature (in any language) on this topic, i.e. the formal analysis of the ideographic characterization of the dynamics of theories between Kuhn’s theory of science and structural epistemology, that is as systematic and complete as Perrone’s work”. (shrink)

We show that a paraconsistent set theory proposed in Weber (2010) is strong enough to provide a quite classical nonprimitive notion of identity, so that the relation is an equivalence relation and also obeys full substitutivity: a = b -> F(b)). With this as background it is shown that the proposed theory also proves the negation of x=x. While not by itself showing that the proposed system is trivial in the sense of proving all statements, it is argued that this (...) outcome makes the system inadequate. (shrink)

In 1922, Thoralf Skolem introduced the term of «relativity» as to infinity от set theory. Не demonstrated Ьу Zermelo 's axiomatics of set theory (incl. the axiom of choice) that there exists unintended interpretations of anу infinite set. Тhus, the notion of set was also «relative». We сan apply his argurnentation to Gödel's incompleteness theorems (1931) as well as to his completeness theorem (1930). Then, both the incompleteness of Реапо arithmetic and the completeness of first-order logic tum out to bе (...) also «relative» in Skolem 's sense. Skolem 's «relativity» argumentation of that kind сan bе applied to а vету wide range of problems and one сan spoke of the relativity of discreteness and continuity or, of finiiteness and infinity, or, of Cantor 's kinds of infinities, etc. The relativity of Skolemian type helps us for generaIizing Einstein 's principle of relativity from the invariance of the physical laws toward diffeomorphisms to their invariance toward anу morphisms (including and especiaIly the discrete ones). Such а kind of generalization from diffeomorphisms (then, the notion of velocity always makes sense) to anу kind of morphism (when 'velocity' mау оr maу not make sense) is an extension of the general Skolemian type оГ relativity between discreteness and continuity от between finiteness and infinity. Particularly, the Lorentz invariance is not valid in general because the notion of velocity is limited to diffeomorphisms. [п the case of entanglement, the physical interaction is discrete0. 'Velocity" and consequently, the 'Lorentz invariance'"do not make sense. Тhat is the simplest explanation ofthe argurnent EPR, which tums into а paradox оnJу if the universal validity of 'velocity' and 'Lогелtz invariance' is implicitly accepted. (shrink)

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

Can the so-ca\led first incompleteness theorem refer to itself? Many or maybe even all the paradoxes in mathematics are connected with some kind of self-reference. Gбdel built his proof on the ground of self-reference: а statement which claims its unprovabllity. So, he demonstrated that undecidaЬle propositions exist in any enough rich axiomatics (i.e. such one which contains Peano arithmetic in some sense). What about the decidabllity of the very first incompleteness theorem? We can display that it fulfills its conditions. That's (...) why it can Ье applied to itself, proving that it is an undecidaЬle statement. It seems to Ье а too strange kind of proposition: its validity implies its undecidabllity. If the validity of а statement implies its untruth, then it is either untruth (reductio ad absurdum) or an antinomy (if also its negation implies its validity). А theory that contains а contradiction implies any statement. Appearing of а proposition, whose validity implies its undecidabllity, is due to the statement that claims its unprovability. Obviously, it is а proposition of self-referential type. Ву Gбdel's words, it is correlative with Richard's or liar paradox, or even with any other semantic or mathematical one. What is the cost, if а proposition of that special kind is used in а proof? ln our opinion, the price is analogous to «applying» of а contradictory in а theory: any statement turns out to Ье undecidaЬ!e. Ifthe first incompleteness theorem is an undecidaЬ!e theorem, then it is impossiЬle to prove that the very completeness of Peano arithmetic is also an tmdecidaЬle statement (the second incompleteness theorem). Hilbert's program for ап arithmetical self-foundation of matheшatics is partly rehabllitated: only partly, because it is not decidaЬ!e and true, but undecidaЬle; that's wby both it and its negation шау Ье accepted as true, however not siшultaneously true. The first incompleteness theoreш gains the statute of axiom of а very special, semi-philosophical kind: it divides mathematics as whole into two parts: either Godel шathematics or Нilbert matheшatics. Нilbert's program of self-foundation ofmatheшatic is valid only as to the latter. (shrink)