Multiverse Set Theory and Absolutely Undecidable Propositions
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Does the Category of Multisets Require a Larger Universe Than
Pure Mathematical Sciences, Vol. 2, 2013, no. 3, 133 - 146 HIKARI Ltd, www.m-hikari.com Does the Category of Multisets Require a Larger Universe than that of the Category of Sets? Dasharath Singh (Former affiliation: Indian Institute of Technology Bombay) Department of Mathematics, Ahmadu Bello University, Zaria, Nigeria [email protected] Ahmed Ibrahim Isah Department of Mathematics Ahmadu Bello University, Zaria, Nigeria [email protected] Alhaji Jibril Alkali Department of Mathematics Ahmadu Bello University, Zaria, Nigeria [email protected] Copyright © 2013 Dasharath Singh et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Abstract In section 1, the concept of a category is briefly described. In section 2, it is elaborated how the concept of category is naturally intertwined with the existence of a universe of discourse much larger than what is otherwise sufficient for a large part of mathematics. It is also remarked that the extended universe for the category of sets is adequate for the category of multisets as well. In section 3, fundamentals required for adequately describing a category are extended to defining a multiset category, and some of its distinctive features are outlined. Mathematics Subject Classification: 18A05, 18A20, 18B99 134 Dasharath Singh et al. Keywords: Category, Universe, Multiset Category, objects. 1. Introduction to categories The history of science and that of mathematics, in particular, records that at times, a by- product may turn out to be of greater significance than the main objective of a research. -
Cantor, God, and Inconsistent Multiplicities*
STUDIES IN LOGIC, GRAMMAR AND RHETORIC 44 (57) 2016 DOI: 10.1515/slgr-2016-0008 Aaron R. Thomas-Bolduc University of Calgary CANTOR, GOD, AND INCONSISTENT MULTIPLICITIES* Abstract. The importance of Georg Cantor’s religious convictions is often ne- glected in discussions of his mathematics and metaphysics. Herein I argue, pace Jan´e(1995), that due to the importance of Christianity to Cantor, he would have never thought of absolutely infinite collections/inconsistent multiplicities, as being merely potential, or as being purely mathematical entities. I begin by considering and rejecting two arguments due to Ignacio Jan´e based on letters to Hilbert and the generating principles for ordinals, respectively, showing that my reading of Cantor is consistent with that evidence. I then argue that evidence from Cantor’s later writings shows that he was still very religious later in his career, and thus would not have given up on the reality of the absolute, as that would imply an imperfection on the part of God. The theological acceptance of his set theory was very important to Can- tor. Despite this, the influence of theology on his conception of absolutely infinite collections, or inconsistent multiplicities, is often ignored in contem- porary literature.1 I will be arguing that due in part to his religious convic- tions, and despite an apparent tension between his earlier and later writings, Cantor would never have considered inconsistent multiplicities (similar to what we now call proper classes) as completed in a mathematical sense, though they are completed in Intellectus Divino. Before delving into the issue of the actuality or otherwise of certain infinite collections, it will be informative to give an explanation of Cantor’s terminology, as well a sketch of Cantor’s relationship with religion and reli- gious figures. -
The Metamathematics of Putnam's Model-Theoretic Arguments
The Metamathematics of Putnam's Model-Theoretic Arguments Tim Button Abstract. Putnam famously attempted to use model theory to draw metaphysical conclusions. His Skolemisation argument sought to show metaphysical realists that their favourite theories have countable models. His permutation argument sought to show that they have permuted mod- els. His constructivisation argument sought to show that any empirical evidence is compatible with the Axiom of Constructibility. Here, I exam- ine the metamathematics of all three model-theoretic arguments, and I argue against Bays (2001, 2007) that Putnam is largely immune to meta- mathematical challenges. Copyright notice. This paper is due to appear in Erkenntnis. This is a pre-print, and may be subject to minor changes. The authoritative version should be obtained from Erkenntnis, once it has been published. Hilary Putnam famously attempted to use model theory to draw metaphys- ical conclusions. Specifically, he attacked metaphysical realism, a position characterised by the following credo: [T]he world consists of a fixed totality of mind-independent objects. (Putnam 1981, p. 49; cf. 1978, p. 125). Truth involves some sort of correspondence relation between words or thought-signs and external things and sets of things. (1981, p. 49; cf. 1989, p. 214) [W]hat is epistemically most justifiable to believe may nonetheless be false. (1980, p. 473; cf. 1978, p. 125) To sum up these claims, Putnam characterised metaphysical realism as an \externalist perspective" whose \favorite point of view is a God's Eye point of view" (1981, p. 49). Putnam sought to show that this externalist perspective is deeply untenable. To this end, he treated correspondence in terms of model-theoretic satisfaction. -
Set-Theoretic Geology, the Ultimate Inner Model, and New Axioms
Set-theoretic Geology, the Ultimate Inner Model, and New Axioms Justin William Henry Cavitt (860) 949-5686 [email protected] Advisor: W. Hugh Woodin Harvard University March 20, 2017 Submitted in partial fulfillment of the requirements for the degree of Bachelor of Arts in Mathematics and Philosophy Contents 1 Introduction 2 1.1 Author’s Note . .4 1.2 Acknowledgements . .4 2 The Independence Problem 5 2.1 Gödelian Independence and Consistency Strength . .5 2.2 Forcing and Natural Independence . .7 2.2.1 Basics of Forcing . .8 2.2.2 Forcing Facts . 11 2.2.3 The Space of All Forcing Extensions: The Generic Multiverse 15 2.3 Recap . 16 3 Approaches to New Axioms 17 3.1 Large Cardinals . 17 3.2 Inner Model Theory . 25 3.2.1 Basic Facts . 26 3.2.2 The Constructible Universe . 30 3.2.3 Other Inner Models . 35 3.2.4 Relative Constructibility . 38 3.3 Recap . 39 4 Ultimate L 40 4.1 The Axiom V = Ultimate L ..................... 41 4.2 Central Features of Ultimate L .................... 42 4.3 Further Philosophical Considerations . 47 4.4 Recap . 51 1 5 Set-theoretic Geology 52 5.1 Preliminaries . 52 5.2 The Downward Directed Grounds Hypothesis . 54 5.2.1 Bukovský’s Theorem . 54 5.2.2 The Main Argument . 61 5.3 Main Results . 65 5.4 Recap . 74 6 Conclusion 74 7 Appendix 75 7.1 Notation . 75 7.2 The ZFC Axioms . 76 7.3 The Ordinals . 77 7.4 The Universe of Sets . 77 7.5 Transitive Models and Absoluteness . -
Sets - June 24 Chapter 1 - Sets and Functions
Math 300 - Introduction to Mathematical reasoning Summer 2013 Lecture 1: Sets - June 24 Chapter 1 - Sets and Functions Definition and Examples Sets are a \well-defined” collection of objects. We shall not say what we mean by \well-defined” in this course. At an introductory level, it suffices to think of a Set as a collection of objects. Some examples of sets are - • Collection of students taking Math 300, • Collection of all possible speeds that your car can attain, • Collection of all matrices with real entries (Math 308). Examples We mention some mathematical examples which we shall use throughout the course. Keep these examples in mind. • N - the set of natural numbers. Here, N = f1; 2; 3;:::; g • Z - the set of integers. Here, Z = f;:::; −3; −2; −1; 0; 1; 2; 3;:::; g • Q - the set of rational numbers. The set of rational numbers can described as fractions, where the numerator and denominator of the fraction are both integers and the denominator is not equal to zero. • R - the set of real numbers. • R+ - the set of positive real numbers. The objects of the set are called elements, members or points of the set. Usually a set is denoted by a capital letter. The elements of the set are denoted by lowercase letters. The symbol 2 denotes the phrase \belongs to". Let A be a set and let x be an element of the set A. The statement x 2 A should be read as x belongs to the set A. For example, the statement \1 2 N" should be read as \1 belongs to the set of natural numbers". -
Arxiv:1205.6044V1 [Math.HO] 28 May 2012 Prescriptive/Prohibitive Context
FOUNDATIONS AS SUPERSTRUCTURE1 (Reflections of a practicing mathematician) Yuri I. Manin Max–Planck–Institut f¨ur Mathematik, Bonn, Germany, ABSTRACT. This talk presents foundations of mathematics as a historically variable set of principles appealing to various modes of human intuition and de- void of any prescriptive/prohibitive power. At each turn of history, foundations crystallize the accepted norms of interpersonal and intergenerational transfer and justification of mathematical knowledge. Introduction Foundations vs Metamathematics. In this talk, I will interpret the idea of Foundations in the wide sense. For me, Foundations at each turn of history embody currently recognized, but historically variable, principles of organization of mathematical knowledge and of the interpersonal/transgenerational transferral of this knowledge. When these principles are studied using the tools of mathematics itself, we get a new chapter of mathematics, metamathematics. Modern philosophy of mathematics is often preoccupied with informal interpre- tations of theorems, proved in metamathematics of the XX–th century, of which the most influential was probably G¨odel’s incompleteness theorem that aroused considerable existential anxiety. In metamathematics, G¨odel’s theorem is a discovery that a certain class of finitely arXiv:1205.6044v1 [math.HO] 28 May 2012 generated structures (statements in a formal language) contains substructures that are not finitely generated (those statements that are true in a standard interpreta- tion). It is no big deal for an algebraist, but certainly interesting thanks to a new context. Existential anxiety can be alleviated if one strips “Foundations” from their rigid prescriptive/prohibitive, or normative functions and considers various foundational 1Talk at the international interdisciplinary conference “Philosophy, Mathematics, Linguistics: Aspects of Interaction” , Euler Mathematical Institute, May 22–25, 2012. -
Review of Set-Theoretic Notations and Terminology A.J
Math 347 Review of Set-theoretic Notations and Terminology A.J. Hildebrand Review of Set-theoretic Notations and Terminology • Sets: A set is an unordered collection of objects, called the elements of the set. The standard notation for a set is the brace notation f::: g, with the elements of the set listed inside the pair of braces. • Set builder notation: Notation of the form f::: : ::: g, where the colon (:) has the meaning of \such that", the dots to the left of the colon indicate the generic form of the element in the set and the dots to 2 the right of the colon denote any constraints on the element. E.g., fx 2 R : x < 4g stands for \the set of 2 all x 2 R such that x < 4"; this is the same as the interval (−2; 2). Other examples of this notation are f2k : k 2 Zg (set of all even integers), fx : x 2 A and x 2 Bg (intersection of A and B, A \ B). 2 Note: Instead of a colon (:), one can also use a vertical bar (j) as a separator; e.g., fx 2 R j x < 4g. Both notations are equally acceptable. • Equality of sets: Two sets are equal if they contain the same elements. E.g., the sets f3; 4; 7g, f4; 3; 7g, f3; 3; 4; 7g are all equal since they contain the same three elements, namely 3, 4, 7. • Some special sets: • Empty set: ; (or fg) • \Double bar" sets: 1 ∗ Natural numbers: N = f1; 2;::: g (note that 0 is not an element of N) ∗ Integers: Z = f:::; −2; −1; 0; 1; 2;::: g ∗ Rational numbers: Q = fp=q : p; q 2 Z; q 6= 0g ∗ Real numbers: R • Intervals: ∗ Open interval: (a; b) = fx 2 R : a < x < bg ∗ Closed interval: [a; b] = fx 2 R : a ≤ x ≤ bg ∗ Half-open interval: [a; b) = fx 2 R : a ≤ x < bg • Universe: U (\universe", a \superset" of which all sets under consideration are assumed to be a subset). -
Mechanism, Mentalism, and Metamathematics Synthese Library
MECHANISM, MENTALISM, AND METAMATHEMATICS SYNTHESE LIBRARY STUDIES IN EPISTEMOLOGY, LOGIC, METHODOLOGY, AND PHILOSOPHY OF SCIENCE Managing Editor: JAAKKO HINTIKKA, Florida State University Editors: ROBER T S. COHEN, Boston University DONALD DAVIDSON, University o/Chicago GABRIEL NUCHELMANS, University 0/ Leyden WESLEY C. SALMON, University 0/ Arizona VOLUME 137 JUDSON CHAMBERS WEBB Boston University. Dept. 0/ Philosophy. Boston. Mass .• U.S.A. MECHANISM, MENT ALISM, AND MET AMA THEMA TICS An Essay on Finitism i Springer-Science+Business Media, B.V. Library of Congress Cataloging in Publication Data Webb, Judson Chambers, 1936- CII:J Mechanism, mentalism, and metamathematics. (Synthese library; v. 137) Bibliography: p. Includes indexes. 1. Metamathematics. I. Title. QA9.8.w4 510: 1 79-27819 ISBN 978-90-481-8357-9 ISBN 978-94-015-7653-6 (eBook) DOl 10.1007/978-94-015-7653-6 All Rights Reserved Copyright © 1980 by Springer Science+Business Media Dordrecht Originally published by D. Reidel Publishing Company, Dordrecht, Holland in 1980. Softcover reprint of the hardcover 1st edition 1980 No part of the material protected by this copyright notice may be reproduced or utilized in any form or by any means, electronic or mechanical, including photocopying, recording or by any informational storage and retrieval system, without written permission from the copyright owner TABLE OF CONTENTS PREFACE vii INTRODUCTION ix CHAPTER I / MECHANISM: SOME HISTORICAL NOTES I. Machines and Demons 2. Machines and Men 17 3. Machines, Arithmetic, and Logic 22 CHAPTER II / MIND, NUMBER, AND THE INFINITE 33 I. The Obligations of Infinity 33 2. Mind and Philosophy of Number 40 3. Dedekind's Theory of Arithmetic 46 4. -
The History of Logic
c Peter King & Stewart Shapiro, The Oxford Companion to Philosophy (OUP 1995), 496–500. THE HISTORY OF LOGIC Aristotle was the first thinker to devise a logical system. He drew upon the emphasis on universal definition found in Socrates, the use of reductio ad absurdum in Zeno of Elea, claims about propositional structure and nega- tion in Parmenides and Plato, and the body of argumentative techniques found in legal reasoning and geometrical proof. Yet the theory presented in Aristotle’s five treatises known as the Organon—the Categories, the De interpretatione, the Prior Analytics, the Posterior Analytics, and the Sophistical Refutations—goes far beyond any of these. Aristotle holds that a proposition is a complex involving two terms, a subject and a predicate, each of which is represented grammatically with a noun. The logical form of a proposition is determined by its quantity (uni- versal or particular) and by its quality (affirmative or negative). Aristotle investigates the relation between two propositions containing the same terms in his theories of opposition and conversion. The former describes relations of contradictoriness and contrariety, the latter equipollences and entailments. The analysis of logical form, opposition, and conversion are combined in syllogistic, Aristotle’s greatest invention in logic. A syllogism consists of three propositions. The first two, the premisses, share exactly one term, and they logically entail the third proposition, the conclusion, which contains the two non-shared terms of the premisses. The term common to the two premisses may occur as subject in one and predicate in the other (called the ‘first figure’), predicate in both (‘second figure’), or subject in both (‘third figure’). -
A Multiverse Perspective in Mathematics and Set Theory: Does Every Mathematical Statement Have a Definite Truth Value?
The universe view The multiverse view Dream Solution of CH is unattainable Further topics Multiverse Mathematics A multiverse perspective in mathematics and set theory: does every mathematical statement have a definite truth value? Joel David Hamkins The City University of New York Mathematics, Philosophy, Computer Science College of Staten Island of CUNY The CUNY Graduate Center Meta-Meta Workshop: Metamathematics and Metaphysics Fudan University, Shanghai June 15, 2013 Meta-Meta Workshop, Shanghai June 15, 2013 Joel David Hamkins, New York The universe view The multiverse view Dream Solution of CH is unattainable Further topics Multiverse Mathematics The theme The theme of this talk is the question: Does every mathematical problem have a definite answer? I shall be particularly interested in this question as it arises in the case of set theory: Does every set-theoretic assertion have a definite truth value? Meta-Meta Workshop, Shanghai June 15, 2013 Joel David Hamkins, New York The universe view The multiverse view Dream Solution of CH is unattainable Further topics Multiverse Mathematics Set theory as Ontological Foundation A traditional view in set theory is that it serves as an ontological foundation for the rest of mathematics, in the sense that other abstract mathematical objects can be construed fundamentally as sets. On this view, mathematical objects—functions, real numbers, spaces—are sets. Being precise in mathematics amounts to specifying an object in set theory. In this way, the set-theoretic universe becomes the realm of all mathematics. Having a common foundation was important for the unity of mathematics. A weaker position remains compatible with structuralism. -
Axiomatic Foundations of Mathematics Ryan Melton Dr
Axiomatic Foundations of Mathematics Ryan Melton Dr. Clint Richardson, Faculty Advisor Stephen F. Austin State University As Bertrand Russell once said, Gödel's Method Pure mathematics is the subject in which we Consider the expression First, Gödel assigned a unique natural number to do not know what we are talking about, or each of the logical symbols and numbers. 2 + 3 = 5 whether what we are saying is true. Russell’s statement begs from us one major This expression is mathematical; it belongs to the field For example: if the symbol '0' corresponds to we call arithmetic and is composed of basic arithmetic question: the natural number 1, '+' to 2, and '=' to 3, then symbols. '0 = 0' '0 + 0 = 0' What is Mathematics founded on? On the other hand, the sentence and '2 + 3 = 5' is an arithmetical formula. 1 3 1 1 2 1 3 1 so each expression corresponds to a sequence. Axioms and Axiom Systems is metamathematical; it is constructed outside of mathematics and labels the expression above as a Then, for this new sequence x1x2x3…xn of formula in arithmetic. An axiom is a belief taken without proof, and positive integers, we associate a Gödel number thus an axiom system is a set of beliefs as follows: x1 x2 x3 xn taken without proof. enc( x1x2x3...xn ) = 2 3 5 ... pn Since Principia Mathematica was such a bold where the encoding is the product of n factors, Consistent? Complete? leap in the right direction--although proving each of which is found by raising the j-th prime nothing about consistency--several attempts at to the xj power. -
Set Notation and Concepts
Appendix Set Notation and Concepts “In mathematics you don’t understand things. You just get used to them.” John von Neumann (1903–1957) This appendix is primarily a brief run-through of basic concepts from set theory, but it also in Sect. A.4 mentions set equations, which are not always covered when introducing set theory. A.1 Basic Concepts and Notation A set is a collection of items. You can write a set by listing its elements (the items it contains) inside curly braces. For example, the set that contains the numbers 1, 2 and 3 can be written as {1, 2, 3}. The order of elements do not matter in a set, so the same set can be written as {2, 1, 3}, {2, 3, 1} or using any permutation of the elements. The number of occurrences also does not matter, so we could also write the set as {2, 1, 2, 3, 1, 1} or in an infinity of other ways. All of these describe the same set. We will normally write sets without repetition, but the fact that repetitions do not matter is important to understand the operations on sets. We will typically use uppercase letters to denote sets and lowercase letters to denote elements in a set, so we could write M ={2, 1, 3} and x = 2 as an element of M. The empty set can be written either as an empty list of elements ({})orusing the special symbol ∅. The latter is more common in mathematical texts. A.1.1 Operations and Predicates We will often need to check if an element belongs to a set or select an element from a set.