Set Theory: Forcing and Semantics. Roger Bishop Jones

Similar documents
Gödel s Programm and Ultimate L

The modal logic of forcing

1. Introduction to commutative rings and fields

arxiv: v1 [math.lo] 7 Dec 2017

Absolutely ordinal definable sets

Philosophy of Set Theory

Towards a Contemporary Ontology

Handbook of Logic and Proof Techniques for Computer Science

Introduction to Metalogic

Gödel in class. Achim Feldmeier Brno - Oct 2010

Class 15: Hilbert and Gödel

WHY ISN T THE CONTINUUM PROBLEM ON THE MILLENNIUM ($1,000,000) PRIZE LIST?

Lecture 33 Carnap on Theory and Observation

Modal Logic of Forcing Classes

Tallness and Level by Level Equivalence and Inequivalence

We will now make precise what is meant by a syntactic characterization of the set of arithmetically true sentences.

UPWARD CLOSURE AND AMALGAMATION IN THE GENERIC MULTIVERSE OF A COUNTABLE MODEL OF SET THEORY

How Philosophy Impacts on Mathematics

The Legacy of Hilbert, Gödel, Gentzen and Turing

PROOF-THEORETIC REDUCTION AS A PHILOSOPHER S TOOL

1. Introduction to commutative rings and fields

Descriptive Set Theory: Why Should We Study It?

The set-theoretic multiverse: a model-theoretic philosophy of set theory

INCOMPLETENESS I by Harvey M. Friedman Distinguished University Professor Mathematics, Philosophy, Computer Science Ohio State University Invitation

An Introduction to Modal Logic I

Poincaré s Thesis CONTENTS. Peter Fekete

The roots of computability theory. September 5, 2016

Stanford Encyclopedia of Philosophy

Seminar I Boolean and Modal Algebras

Creative Objectivism, a powerful alternative to Constructivism

Hypersequent Calculi for some Intermediate Logics with Bounded Kripke Models

Research Statement. Peter Koellner

the logic of provability

An Intuitively Complete Analysis of Gödel s Incompleteness

Graduate Texts in Mathematics 22

Modal Logic XX. Yanjing Wang

Hilbert and the concept of axiom

Type Theory and Constructive Mathematics. Type Theory and Constructive Mathematics Thierry Coquand. University of Gothenburg

Trees and generic absoluteness

Generalizing Gödel s Constructible Universe:

Events Concerning Knowledge

Axioms as definitions: revisiting Hilbert

CISC 1002 [CORC 3310, CC 30.10] Paradoxes and the Limits of Knowledge 3 hours; 3 credits

Kant and Finitism. Crossing Worlds: Mathematical logisc, philosophy, art: For Juliette Kennedy. Bill Tait. 4 June 2016

Indefiniteness, definiteness and semi-intuitionistic theories of sets

cse371/mat371 LOGIC Professor Anita Wasilewska Fall 2018

Singular Failures of GCH and Level by Level Equivalence

Forcing notions in inner models

Section 7.5: Cardinality

University of Oxford, Michaelis November 16, Categorical Semantics and Topos Theory Homotopy type theor

S4LP and Local Realizability

Discrete Mathematics

On the Gödel-Friedman Program (for the Conference in Honor of Harvey Friedman) Geoffrey Hellman

From Constructibility and Absoluteness to Computability and Domain Independence

Hamkins on the Multiverse

A Natural Model of the Multiverse Axioms

Hao Wang Bradford Books, The MIT Press, second printing, 1988

INTRODUCTION TO CARDINAL NUMBERS

2. Introduction to commutative rings (continued)

Observations on Category Theory. John L. Bell

DIAGRAMMATIC SYNTAX AND ITS CONSTRAINTS. 1. Introduction: Applications and Foundations

Agency and Interaction in Formal Epistemology

Principles of Knowledge Representation and Reasoning

Review: Stephen G. Simpson (1999) Subsystems of Second-Order Arithmetic (Springer)

Almost von Neumann, Definitely Gödel: The Second Incompleteness Theorem s Early Story

cse541 LOGIC FOR COMPUTER SCIENCE

Understanding Computation

CS3110 Fall 2013 Lecture 11: The Computable Real Numbers, R (10/3)

Introduction to Logic and Axiomatic Set Theory

Mathematical Logic. An Introduction

The triple helix. John R. Steel University of California, Berkeley. October 2010

Incompleteness Theorems, Large Cardinals, and Automata ov

Class 29 - November 3 Semantics for Predicate Logic

Type Theory and Univalent Foundation

The multiverse perspective on determinateness in set theory

CHAPTER 11. Introduction to Intuitionistic Logic

Throwing Darts, Time, and the Infinite

Frege: Logical objects by abstraction and their criteria of identity. Matthias Schirn (University of Munich, Munich Center of Mathematical Philosophy)

Completeness Theorems and λ-calculus

The axiom of choice and two-point sets in the plane

October 12, Complexity and Absoluteness in L ω1,ω. John T. Baldwin. Measuring complexity. Complexity of. concepts. to first order.

Complexity Theory Turing Machines

The Axiom of Choice and its Discontents

Informal Statement Calculus

A Little History Incompleteness The First Theorem The Second Theorem Implications. Gödel s Theorem. Anders O.F. Hendrickson

Henkin s Method and the Completeness Theorem

Lecture 27 POLYNOMIALS

Weak Choice Principles and Forcing Axioms

CS3110 Spring 2017 Lecture 11: Constructive Real Numbers

Set-theoretic Geology, the Ultimate Inner. Model, and New Axioms. Justin William Henry Cavitt. Advisor: W. Hugh Woodin. Harvard University

Popper School Methodological Disproof of Quantum Logic

Philosophy of Mathematics Intuitionism

CS 275 Automata and Formal Language Theory

The logical structure of relativity theory

Neale and the slingshot Fabrice Correia

Underdetermination, Logic, Mathematics, and Science

Discrete Mathematics: Lectures 6 and 7 Sets, Relations, Functions and Counting Instructor: Arijit Bishnu Date: August 4 and 6, 2009

Victoria Gitman and Thomas Johnstone. New York City College of Technology, CUNY

Gleason s Theorem for non-separable Hilbert spaces: Extended abstract

Hilbert s Nustellensatz: Inner Model Theory: Ahmed T Khalil. Elliot Glazer. REU Advisor: Dr. Grigor Sargsyan. A Model-Theoretic Approach

Transcription:

Set Theory: Forcing and Semantics Roger Bishop Jones

Contents Preface 2 1 Introduction 2 2 Semantic Logicism 3 2.1 formalism........................ 4 2.2 Some Notes on Carnap................. 4 3 Forcing 4 3.1 Preliminaries...................... 5 3.2 A Basic Fact...................... 5.1 Cohen on Avoiding SM................ 6 Bibliography 6 Index 6 1 Introduction This essay responds to some of the recent publications in the philosophy of mathematics which either are or might be connected with the semantics of set theory. It is concerned particularly with the relevance of forcing to questions in the semantics of set theory or to the question of what axioms should be used for set theory. I am concerned more specifically to two major recent developments in which forcing plays a central role, the work of Woodin and Koellner on the resolution of CH, and the work of Hamkins in connection with the multiverse theory, the modal logic of forcing, and set theoretic geology. These lines of research are highly technical. It is not intended to engage with or contribute to the technical developments, but rather to consider the grounds for believing that the technical results are relevant to the issues. Thus, in the case of the resolution of CH, various technical results are held to provide evidence for or against CH, and we are concerned to understand why this is 2

2 SEMANTIC LOGICISM 3 thought to be the case. The rational for multiverse theory is based upon considerations arising from generic extensibility, and the ancillary investigations into the modal logic and set theoretic geology investigate set theory by examining the relationship between models and their forcing extensions. Both the arguments for the multiverse theory and the reasons for giving such a prominent role to forcing in the study of that multiverse are to be considered. The analysis is undertaken from a particular philosophical standpoint which is similar in character to the philosophy of Rudolf Carnap. Peter Koellner has criticised Carnap s pluralism and his own approach to the resolution of CH (and the more general problem of discovering or justifying new axioms for set theory) is presented by him in contrast to Carnap s pluralism. The question of pluralism and the related question of whether there are absolutely undecidable problems are intimately bound up with his work on CH. My own understanding of Carnap s philosophy, and more specifically of his pluralism, differs from that of Koellner, is not open to the same objections, and furnishes a standpoint from which a fruitful analysis and critique of the work of Koellner and Hamkins can be approached. I therefore begin with a presention of key elements of that standpoint, contrasting it with the Koellner s interpretation of Carnap. 2 Semantic Logicism In this section I describe a semantic standpoint from which matters pertaining to the foundations of mathematics may be addressed. This is described by comparison with a selection of alternative positions. These descriptions are not offered as historically accurate descriptions of the beliefs of philosophers, though various philosophers are mentioned as exemplars (or even authors) of the features discussed. The closest predecessor to the position I describe is found in the philosophy of Rudolf Carnap. Like Carnap s philosophy of mathematics, it may be thought of a synthesis of logicism and formalism,

in which the logicism is semantic rather than metaphysical. To give a fuller description the following varieties of logicism and formalism are considered. 2.1 formalism The notion of formalism I consider here is one which I associate with Hilbert, but which is distinct from the programme normally associated with Hilbert whose purpose was to estabish the consistency of the foundations of mathematics. It is more closely related to the doctrine, against which Frege argued, to the effect that mathematics is a purely formal discipline in which symbols are manipulated without assigning to them any meaning or significance. The In the first instance I distinguish radical, narrow and broad formalism. 2.2 Some Notes on Carnap Carnap attended lecture courses given by Frege as an undergraduate. He was impressed by the precision of the methods and their contrast with the standard of arguments in philosophy. 3 Forcing The plan at present for this section is: Three observations: 1. There are no generic extensions of V. 2. (ZF C (M = P ) B, G(G is a generic ultrafilter in B over M)))) (ZF C P ) 3. A fallacious proof method. Their application in Jech. 4

3 FORCING 5 Other interpretations of Jech. Possible causes. Applications elsewhere. 3.1 Preliminaries In the following we are concerned with what is provable in the first order theory ZFC, primarily with results about ZFC and its models. Though ZFC is a pure theory of sets, it is customary to simulate talk about classes using class abstracts as what Russell would have called incomplete symbols or Quine, virtual classes. Quantification of classes is not possible, but theorem schemata can be proven. If M is a transitive model (set or class), B is an M complete boolean algebra and G is a generic ultrafilter over B, then the generic extension M[G] is the transitive collapse of the quotient of the boolean valued model M B by the ultrafilter G (the collapse of M B /G). Bell and Jech both prove that under these conditions: G M[G] (1) M M[G] (2) The notion of a generic extension of a transitive model (possibly a class) M is defined in Jech 14.30 and 14.32 and Bell p97. 3.2 A Basic Fact Here is a first brute fact: There are no generic extensions of V. In this the notion of generic extension is as defined in Jech 14.30 and 14.32 and Bell p97. The notation for this in both cases is M[G] where M is a transitive set or class and G is an M generic ultrafilter over some boolean algebra complete in M. V is the class abstract {x T }. ZF C x(x V ) (3)

ZF C V M (4) Jech [Jec02] (4.22) and Bell [Bel05] (14.32) both prove: If M[G].1 Cohen on Avoiding SM In his book on the continuum hypothesis[coh66] Paul Cohen proceeds from the assumption that there exists a standard model (SM) of ZFC. In Chapter IV 11 he then explains how this assumption can be dispensed with if one does not care about the construction of actual models. References [Bel05] John L. Bell. Set Theory - Boolean-valued Models and Independence Proofs. Oxford University Press, 2005. [Coh66] Paul J. Cohen. Set Theory and the Continuum Hypothesis. 1966. [Jec02] Thomas Jech. Set Theory. Springer Verlag, 2002. 6

REFERENCES 7 Started 2011-09-01 Last Change Date: 2012/11/01 15:59:56 http://www.rbjones.com/rbjpub/www/papers/p017.pdf Draft Id: p017.tex,v 1.3 2012/11/01 15:59:56 rbj Exp