Outer Model Satisfiability. M.C. (Mack) Stanley San Jose State
|
|
- Elizabeth Washington
- 5 years ago
- Views:
Transcription
1 Outer Model Satisfiability M.C. (Mack) Stanley San Jose State
2 The Universe of Pure Sets V 0 = V α+1 = P(V α ) = { x : x V α } V λ = V α, λ a limit α<λ V = α V α Axiomatized by ZFC incompletely Goal: Investigate first-order extensions of ZFC that are compatible with (1) well-foundedness and (2) inclusiveness/bigness. Difficulty: The semantic counterpart of No feature of V implies φ is impossible is There exists a larger universe in which φ is true. Least restrictive approach: Standard set models of ZFC. 2
3 Use of the Alphabet V a (countable, if need be) standard transitive set model of ZFC, proxy for the real universe M a definable inner model of V W an outer model of V = V OR V. 3
4 Outer Models Let V be a standard transitive model of ZFC. W is a weak outer model of V if W V, W is also a standard transitive model of ZFC, and W OR = V OR. W is a strong outer model of V if also (W ; V ) ZFC. Remarks: Familiar techniques produce strong outer models. We will be concerned with whether statements not containing the symbol V are necessarily false or potentially true. Weak outer models are relevant. 4
5 Generic Absoluteness Two lines of auxiliary axioms compatible with the bigness/inclusiveness of V : Large cardinal axioms strong versions of the Axiom of Infinity Forcing axioms some statements that can be forced already are true in V Remarkable development: Large cardinal axioms imply that statements up to a certain logical complexity are absolute for set forcing. Limit of absoluteness relative to just ZFC: Shoenfield Absoluteness If φ is a Σ 1 2 (Pω) sentence of arithmetic, then φ is true in some outer model of V iff φ is true in V. 5
6 Theorem (Martin, Solovay) Assume that V ZFC + every set has a sharp. If φ is a Σ 1 3 (Pω) sentence of arithmetic, then φ is true in some set generic extension of V iff φ is true in V. Theorem (Beller, Jensen) Assume that V ZFC+ every set has a sharp. There exists a Σ 1 3 ( ) sentence φ such that φ is true in a definably class generic extension of V, but φ is false in V. Suspicious features: The Σ 1 3 sentence is x ω α < ω 1 L α [x] ZFC This is incompatible with the base theory every set has a sharp. The class forcing minimalizes the outer model. 6
7 Minimality and Sufficient Non-minimality A model V is minimal if there exists x V such that each element of V is first-order definable from parameters in x. Notation: HYP(V ) is the smallest admissible set with V as an element. HYP(V ) = L α (V ), where α is least such that this structure satisfies KP. Degrees of non-minimality: is definably regular in HYP(V ) HYP(V ) satisfies that V -Ramsey cardinals are definably stationary in HYP(V ) satisfies that has this or that large cardinal property 7
8 Back to Generic Absoluteness Theorem (Woodin) Assume that V ZFC + CH + there exists a proper class of measurable Woodin cardinals. If φ is a Σ 2 1 (Pω) sentence in the language of arithmetic, then φ is true in a set generic extension of V that satisfies ZFC + CH iff φ is true in V. Best possible theorem: There exist Σ 2 1 (P2 ω) sentences φ and ψ such that φ and ψ are each satisfiable in set generic extensions that add no reals φ ψ implies that ω 1 is collapsed Next best: Determine which Σ 2 1 (P2 ω) statements are necessarily false. Σ 2 1 (P2 ω) Satisfiability Problem: Assume CH. Give a uniform first-order definition of the family of Σ 2 1 (P2 ω) sentences that are false in every outer model having the same reals. 8
9 The Branch Problem at ω 1 Assuming CH, the branch problem at ω 1 is equivalent to the Σ 2 1 (P2 ω) satisfiability problem. Say that a tree T of height and cardinality ω 1 is branchable if it has a cofinal branch in some outer model with the same reals. Branch problem at ω 1 : Give a uniform first-order definition of the set of branchable trees in models of ZFC + CH. 9
10 Approximations to a Solution to the Branch Problem at ω 1 Any regressively special tree cannot get a new branch without collapsing ω 1. Any countably distributive tree can get a new branch without adding reals. Theorem (Baumgartner) It is consistent relative to the existence of an inaccessible cardinal that every tree of height and cardinality ω 1 is either regressively special or countably distributive and 2 ω = ω 2. Theorem (Shelah) It is consistent relative to the existence of an inaccessible cardinal that CH holds and every ω 1 -tree is either regressively special or countably distributive. There are several seemingly plausible strategies for solving the branch problem. 10
11 Anti-characterization Theorem Assume that ZFC + CH has standard models. There is no uniform definition of the family { } T V : T is branchable that works in all standard transitive models V of ZFC + CH. Reasonable features: Uniform definition is ruled out Small parameters are ok parameters in H ω2 Suspicious features: Proof: Jensen coding is used in a model of the form L[x], x ω. The proof is easily broken by large cardinals. Bad models are minimal 11
12 Escape from Anti-characterization Corollary to the Main Theorem There exists a parameter-free formula that defines the family { } T V : T is branchable over any sufficiently non-minimal model of ZFC + Ramsey cardinals are definably stationary. 12
13 Main Theorem There exists a formula GOOD(x) as follows: Let V be a countable standard transitive model of ZFC + = ZFC + Ramsey cardinals are definably stationary. Assume that κ is regular and uncountable in V. Let T Hκ V first-order axioms, perhaps with parameters in Hκ V. be a set of (1) If H V κ GOOD[T ], there exists a weak outer model of V that satisfies T. If also V is sufficiently non-minimal, then V has a strong outer model that satisfies T. (2) If H V κ GOOD[T ] and V is sufficiently non-minimal, then T is not satisfiable in any weak outer model of V. The formula GOOD can be taken to be parameter-free Π 2. If κ > ω 1 and r H κ is uncountable, then GOOD can be taken to be Π 1 in the parameter r. 13
14 Weak vs Strong Outer Models Main Theorem There exists a formula GOOD(x) as follows: Let V be a countable standard transitive model of ZFC + and let κ be regular and uncountable in V. Let T H V κ be a set of first-order axioms, perhaps with parameters in H V κ. (1) If H V κ GOOD[T ], there exists a weak outer model of V that satisfies T. If also V is sufficiently non-minimal, then V has a strong outer model that satisfies T. (2) If H V κ GOOD[T ] and V is sufficiently non-minimal, then T is not satisfiable in any weak outer model of V. sufficiently non-minimal = HYP(V ) is definably regular sufficiently non-minimal = HYP(V ) Ramseys are definably stationary in satisfiable in a weak outer model satisfiable in a strong outer model, provided that V is sufficiently non-minimal 14
15 First-order Extensions of ZFC are not Enough Fixed-Point Limitation Assume that ZFC ZFC is recursive and has countable standard transitive models V ZFC + PROMISING[T ] V has an outer model that satisfies T V ZFC + UNPROMISING[T ] No outer model of V satisfies T There exists φ such that neither PROMISING[ZFC +φ] nor UNPROMISING[ZFC +φ] holds in any countable standard transitive model of ZFC. Let φ be such that ZFC φ UNPROMISING(ZFC + φ). Fix some V ZFC. V UNPROMISING(ZFC + φ); otherwise V ZFC + φ contradiction! V PROMISING(ZFC + φ); otherwise let W be an outer model, W ZFC + φ. Then W UNPROMISING(ZFC + φ) contradiction! Rough conclusion: The quality of W satisfying a PROMISING φ may decline. 15
16 Proof of the Main Theorem Questions to answer: What is the formula GOOD? How is the first-order large cardinal hypothesis used? How is sufficient non-minimality used? 16
17 Main Theorem, almost There exists a formula GOOD(x) as follows: Let V be a countable standard transitive model of ZFC + = ZFC + measurable cardinals are definably stationary. Let T V be a set of first-order axioms in the language of set theory with parameters in V. (1) If V GOOD[T ], there exists a weak outer model of V that satisfies T. (2) If V GOOD[T ] and V is sufficiently non-minimal, then T is not satisfiable in any weak outer model of V. 17
18 Outer Model Theories Language for weak outer models: {, F} { a : a V } Weak outer model theory of T over V womth(v, T ): T ZFC in the language of set theory x ( x a b a x = b), for each a V y ( y F" OR ) α F(α) F"α Equivalent: V has a weak outer model satisfying T womth(v, T ) has a model omitting Θ (x) = {x OR} { x = α : α < } Can this be reduced to simple consistency? 18
19 Define: Operation Γ on X V consisting of sentences in the weak outer model language: φ Γ(X) iff X φ or φ is x OR ψ(x) where X ψ(α) for all α < Notation: Let X + = the smallest Z X such that Γ(Z) = Z Then: (1) womth(v, T ) + locally omits Θ (x) = {x OR} { x = α : α < } (2) womth(v, T ) + is Σ 1 definable over HYP(V ) (3) Equivalent: V has a weak outer model satisfying T womth(v, T ) + is consistent Is womth(v, T ) + definable over V? 19
20 Define: womth(v, T ) = womth(v κ, T ) + measurable κ with T V κ Using that V ZFC + measurables are definably stationary, Then: womth(v, T ) is a fixed-point of Γ So womth(v, T ) + womth(v, T ) So V womth(v, T ) consistent T satisfied in some weak outer model of V Let GOOD(T ) be womth(v, T ) is consistent 20
21 For D a measure on κ: Then M = lim α< Ult (α)( V κ, D ) HYP(M) = lim α< Ult (α)( HYP(V κ ), D ), assuming V is sufficiently non-minimal (= is definably regular in HYP(V ) ). So womth(v κ, T ) + womth(m, T ) + womth(v, T ) + So V womth(v, T ) inconsistent no weak outer model of V satisfies T 21
22 Back to Generic Absoluteness, Again Looks good: Assume that V ZFC + CH, V is rich in large cardinals, and V is sufficiently non-minimal. Then any Σ 2 1 (Pω) sentence that holds in some set generic extension satisfying ZFC + CH already holds in V, and there is a parameter-free formula BAD (= GOOD) such that, for any set of sentences T ZFC + CH: V BAD(T ) if and only if T is unsatisfiable in any weak outer model of V. Looks suspicious: Restricted to T H V ω 1, BAD(x) is Σ
23 Corollary (of the Main Theorem) There exists a parameter-free Σ 1 3 sentence φ of arithmetic such that if V ZFC + is sufficiently non-minimal, then φ is false in V, but φ is true in some outer model satisfying ZFC +. Remarks: φ does not hold in any set generic extension of V. Possible: Drop non-minimality hypothesis or get a non-minimal outer model. Conclusion: Even if we require V and its outer models (1) to satisfy some large cardinal extension of ZFC and (2) to be sufficiently non-minimal, ψ holds in some outer model ψ holds in a set generic extension cannot be equivalent, even for Σ 1 3 sentences of arithmetic. Point: This cannot be waived away like the Beller-Jensen example. 23
24 Degrees of Goodness and Badness Assume V ZFC + is sufficiently non-minimal. Outer ZFC + -Model Satisfiable Sentences Sentences Satisfiable in a Sufficiently Non-minimal Outer Model of ZFC + Set Forcible Sentences Outer ZFC + -Model Unsatisfiable Sentences End Extension Unsatisfiable Sentences Sentences Refuted by ZFC + GOOD BAD Each family is a proper subset of those above it.
Set Theory and the Foundation of Mathematics. June 19, 2018
1 Set Theory and the Foundation of Mathematics June 19, 2018 Basics Numbers 2 We have: Relations (subsets on their domain) Ordered pairs: The ordered pair x, y is the set {{x, y}, {x}}. Cartesian products
More informationTrees and generic absoluteness
in ZFC University of California, Irvine Logic in Southern California University of California, Los Angeles November 6, 03 in ZFC Forcing and generic absoluteness Trees and branches The method of forcing
More informationProjective well-orderings of the reals and forcing axioms
Projective well-orderings of the reals and forcing axioms Andrés Eduardo Department of Mathematics Boise State University 2011 North American Annual Meeting UC Berkeley, March 24 27, 2011 This is joint
More informationGeneric Absoluteness. Joan Bagaria and Sy D. Friedman. Abstract. However, this is not true for 1 3 predicates. Indeed, if we add a Cohen real
Generic Absoluteness Joan Bagaria and Sy D. Friedman Abstract We explore the consistency strength of 3 and 4 absoluteness, for a variety of forcing notions. Introduction Shoeneld's absoluteness theorem
More informationOptimal generic absoluteness results from strong cardinals
Optimal generic absoluteness results from strong cardinals University of California, Irvine Spring 204 MAMLS Miami University April 27, 204 Trees and generic absoluteness Sharps and 3 generic absoluteness
More informationGeneralizing Gödel s Constructible Universe:
Generalizing Gödel s Constructible Universe: Ultimate L W. Hugh Woodin Harvard University IMS Graduate Summer School in Logic June 2018 Ordinals: the transfinite numbers is the smallest ordinal: this is
More informationSet Theory and Models of Arithmetic ALI ENAYAT. First European Set Theory Meeting
Set Theory and Models of Arithmetic ALI ENAYAT First European Set Theory Meeting Bedlewo, July 12, 2007 PA is finite set theory! There is an arithmetical formula E(x, y) that expresses the x-th digit of
More informationForcing Axioms and Inner Models of Set Theory
Forcing Axioms and Inner Models of Set Theory Boban Veličković Equipe de Logique Université de Paris 7 http://www.logique.jussieu.fr/ boban 15th Boise Extravaganza in Set Theory Boise State University,
More informationUnsolvable problems, the Continuum Hypothesis, and the nature of infinity
Unsolvable problems, the Continuum Hypothesis, and the nature of infinity W. Hugh Woodin Harvard University January 9, 2017 V : The Universe of Sets The power set Suppose X is a set. The powerset of X
More informationThe Continuum Hypothesis, Part II
The Continuum Hypothesis, Part II W. Hugh Woodin Introduction In the first part of this article, I identified the correct axioms for the structure P(N), N, +,,, which is the standard structure for Second
More informationarxiv: v1 [math.lo] 7 Dec 2017
CANONICAL TRUTH MERLIN CARL AND PHILIPP SCHLICHT arxiv:1712.02566v1 [math.lo] 7 Dec 2017 Abstract. We introduce and study a notion of canonical set theoretical truth, which means truth in a transitive
More informationFORCING AXIOMS AND THE CONTINUUM HYPOTHESIS, PART II: TRANSCENDING ω 1 -SEQUENCES OF REAL NUMBERS
FORCING AXIOMS AND THE CONTINUUM HYPOTHESIS, PART II: TRANSCENDING ω 1 -SEQUENCES OF REAL NUMBERS JUSTIN TATCH MOORE Abstract. The purpose of this article is to prove that the forcing axiom for completely
More informationA simple maximality principle
A simple maximality principle arxiv:math/0009240v1 [math.lo] 28 Sep 2000 Joel David Hamkins The City University of New York Carnegie Mellon University http://math.gc.cuny.edu/faculty/hamkins February 1,
More informationIntroduction to Model Theory
Introduction to Model Theory Jouko Väänänen 1,2 1 Department of Mathematics and Statistics, University of Helsinki 2 Institute for Logic, Language and Computation, University of Amsterdam Beijing, June
More informationVARIATIONS FOR SEPARATING CLUB GUESSING PRINCIPLES
P max VARIATIONS FOR SEPARATING CLUB GUESSING PRINCIPLES TETSUYA ISHIU AND PAUL B. LARSON Abstract. In his book on P max [6], Woodin presents a collection of partial orders whose extensions satisfy strong
More informationThe constructible universe
The constructible universe In this set of notes I want to sketch Gödel s proof that CH is consistent with the other axioms of set theory. Gödel s argument goes well beyond this result; his identification
More informationFirst-Order Logic. 1 Syntax. Domain of Discourse. FO Vocabulary. Terms
First-Order Logic 1 Syntax Domain of Discourse The domain of discourse for first order logic is FO structures or models. A FO structure contains Relations Functions Constants (functions of arity 0) FO
More informationThe modal logic of forcing
Joel David Hamkins New York University, Philosophy The City University of New York, Mathematics College of Staten Island of CUNY The CUNY Graduate Center London, August 5 6, 2011 This is joint work with
More informationDiamond, non-saturation, and weak square principles
Diamond, non-saturation, and weak square principles Logic Colloquium 2009 (European ASL summer meeting) 02-Aug-09, Sofia Assaf Rinot Tel-Aviv University http://www.tau.ac.il/ rinot 1 Diamond on successor
More informationThe triple helix. John R. Steel University of California, Berkeley. October 2010
The triple helix John R. Steel University of California, Berkeley October 2010 Three staircases Plan: I. The interpretability hierarchy. II. The vision of ultimate K. III. The triple helix. IV. Some locator
More informationHandbook of Set Theory. Foreman, Kanamori, and Magidor (eds.)
Handbook of Set Theory Foreman, Kanamori, and Magidor (eds.) August 5, 2006 2 Contents I Forcing over models of determinacy 5 by Paul B. Larson 1 Iterations............................... 7 2 P max.................................
More informationA NOTE ON THE EIGHTFOLD WAY
A NOTE ON THE EIGHTFOLD WAY THOMAS GILTON AND JOHN KRUEGER Abstract. Assuming the existence of a Mahlo cardinal, we construct a model in which there exists an ω 2 -Aronszajn tree, the ω 1 -approachability
More informationGödel s Programm and Ultimate L
Gödel s Programm and Ultimate L Fudan University National University of Singapore, September 9, 2017 Outline of Topics 1 CT s Problem 2 Gödel s Program 3 Ultimate L 4 Conclusion Remark Outline CT s Problem
More informationTutorial 1.3: Combinatorial Set Theory. Jean A. Larson (University of Florida) ESSLLI in Ljubljana, Slovenia, August 4, 2011
Tutorial 1.3: Combinatorial Set Theory Jean A. Larson (University of Florida) ESSLLI in Ljubljana, Slovenia, August 4, 2011 I. Generalizing Ramsey s Theorem Our proof of Ramsey s Theorem for pairs was
More informationAn inner model from Ω-logic. Daisuke Ikegami
An inner model from Ω-logic Daisuke Ikegami Kobe University 12. November 2014 Goal & Result Goal Construct a model of set theory which is close to HOD, but easier to analyze. Goal & Result Goal Construct
More informationUNIVERSALLY BAIRE SETS AND GENERIC ABSOLUTENESS TREVOR M. WILSON
UNIVERSALLY BAIRE SETS AND GENERIC ABSOLUTENESS TREVOR M. WILSON Abstract. We prove several equivalences and relative consistency results involving notions of generic absoluteness beyond Woodin s ) (Σ
More informationTallness and Level by Level Equivalence and Inequivalence
Tallness and Level by Level Equivalence and Inequivalence Arthur W. Apter Department of Mathematics Baruch College of CUNY New York, New York 10010 USA and The CUNY Graduate Center, Mathematics 365 Fifth
More informationINTRODUCTION TO CARDINAL NUMBERS
INTRODUCTION TO CARDINAL NUMBERS TOM CUCHTA 1. Introduction This paper was written as a final project for the 2013 Summer Session of Mathematical Logic 1 at Missouri S&T. We intend to present a short discussion
More informationGREGORY TREES, THE CONTINUUM, AND MARTIN S AXIOM
The Journal of Symbolic Logic Volume 00, Number 0, XXX 0000 GREGORY TREES, THE CONTINUUM, AND MARTIN S AXIOM KENNETH KUNEN AND DILIP RAGHAVAN Abstract. We continue the investigation of Gregory trees and
More informationIncompleteness Theorems, Large Cardinals, and Automata ov
Incompleteness Theorems, Large Cardinals, and Automata over Finite Words Equipe de Logique Mathématique Institut de Mathématiques de Jussieu - Paris Rive Gauche CNRS and Université Paris 7 TAMC 2017, Berne
More informationWHY ISN T THE CONTINUUM PROBLEM ON THE MILLENNIUM ($1,000,000) PRIZE LIST?
WHY ISN T THE CONTINUUM PROBLEM ON THE MILLENNIUM ($1,000,000) PRIZE LIST? Solomon Feferman CSLI Workshop on Logic, Rationality and Intelligent Interaction Stanford, June 1, 2013 Why isn t the Continuum
More informationFORCING WITH SEQUENCES OF MODELS OF TWO TYPES
FORCING WITH SEQUENCES OF MODELS OF TWO TYPES ITAY NEEMAN Abstract. We present an approach to forcing with finite sequences of models that uses models of two types. This approach builds on earlier work
More informationInner models from extended logics
1 / 43 Inner models from extended logics Joint work with Juliette Kennedy and Menachem Magidor Department of Mathematics and Statistics, University of Helsinki ILLC, University of Amsterdam January 2017
More informationAMS regional meeting Bloomington, IN April 1, 2017
Joint work with: W. Boney, S. Friedman, C. Laskowski, M. Koerwien, S. Shelah, I. Souldatos University of Illinois at Chicago AMS regional meeting Bloomington, IN April 1, 2017 Cantor s Middle Attic Uncountable
More information1. Introduction Definition 1.1. For an L ω1,ω-sentence φ, the spectrum of φ is the set
KUREPA TREES AND SPECTRA OF L ω1,ω-sentences DIMA SINAPOVA AND IOANNIS SOULDATOS Abstract. We construct a single L ω1,ω-sentence ψ that codes Kurepa trees to prove the consistency of the following: (1)
More informationProof Theory and Subsystems of Second-Order Arithmetic
Proof Theory and Subsystems of Second-Order Arithmetic 1. Background and Motivation Why use proof theory to study theories of arithmetic? 2. Conservation Results Showing that if a theory T 1 proves ϕ,
More informationModel Theory of Second Order Logic
Lecture 2 1, 2 1 Department of Mathematics and Statistics University of Helsinki 2 ILLC University of Amsterdam March 2011 Outline Second order characterizable structures 1 Second order characterizable
More informationLarge Cardinals and Higher Degree Theory
Large Cardinals and Higher Degree Theory SHI Xianghui School of Mathematical Sciences Beijing Normal University May 2013, NJU 1 / 20 Dedicated to Professor DING DeCheng on his 70 th Birthday. 2 / 20 Higher
More informationA Note on Singular Cardinals in Set Theory without Choice
arxiv:0709.2436v1 [math.lo] 15 Sep 2007 A Note on Singular Cardinals in Set Theory without Choice Denis I. Saveliev 2007 August 11, Beijing Partially supported by grant 06-01-00608-a of Russian Foundation
More informationITERATIONS WITH MIXED SUPPORT
ITERATIONS WITH MIXED SUPPORT VERA FISCHER Abstract. In this talk we will consider three properties of iterations with mixed (finite/countable) supports: iterations of arbitrary length preserve ω 1, iterations
More informationOctober 12, Complexity and Absoluteness in L ω1,ω. John T. Baldwin. Measuring complexity. Complexity of. concepts. to first order.
October 12, 2010 Sacks Dicta... the central notions of model theory are absolute absoluteness, unlike cardinality, is a logical concept. That is why model theory does not founder on that rock of undecidability,
More informationINCOMPLETENESS I by Harvey M. Friedman Distinguished University Professor Mathematics, Philosophy, Computer Science Ohio State University Invitation
INCOMPLETENESS I by Harvey M. Friedman Distinguished University Professor Mathematics, Philosophy, Computer Science Ohio State University Invitation to Mathematics Series Department of Mathematics Ohio
More informationForcing Closed Unbounded Subsets of ω 2
Forcing Closed Unbounded Subsets of ω 2 M.C. Stanley July 2000 Abstract. It is shown that there is no satisfactory first-order characterization of those subsets of ω 2 that have closed unbounded subsets
More informationClassical Propositional Logic
The Language of A Henkin-style Proof for Natural Deduction January 16, 2013 The Language of A Henkin-style Proof for Natural Deduction Logic Logic is the science of inference. Given a body of information,
More informationExtremely large cardinals in the absence of Choice
Extremely large cardinals in the absence of Choice David Asperó University of East Anglia UEA pure math seminar, 8 Dec 2014 The language First order language of set theory. Only non logical symbol: 2 The
More informationby Yurii Khomskii There is a weaker notion called semi-representability:
Gödel s Incompleteness Theorem by Yurii Khomskii We give three different proofs of Gödel s First Incompleteness Theorem. All three proofs are essentially variations of one another, but some people may
More informationSet Theory and Indiscernibles. Ali Enayat. IPM Logic Conference
Set Theory and Indiscernibles Ali Enayat IPM Logic Conference June 2007 LEIBNIZ S PRINCIPLE OF IDENTITY OF INDISCERNIBLES The principle of identity of indiscernibles, formulated by Leibniz (1686), states
More informationInformal Statement Calculus
FOUNDATIONS OF MATHEMATICS Branches of Logic 1. Theory of Computations (i.e. Recursion Theory). 2. Proof Theory. 3. Model Theory. 4. Set Theory. Informal Statement Calculus STATEMENTS AND CONNECTIVES Example
More informationRecursion Theory. Joost J. Joosten
Recursion Theory Joost J. Joosten Institute for Logic Language and Computation University of Amsterdam Plantage Muidergracht 24 1018 TV Amsterdam Room P 3.26, +31 20 5256095 jjoosten@phil.uu.nl www.phil.uu.nl/
More informationHarmonious Logic: Craig s Interpolation Theorem and its Descendants. Solomon Feferman Stanford University
Harmonious Logic: Craig s Interpolation Theorem and its Descendants Solomon Feferman Stanford University http://math.stanford.edu/~feferman Interpolations Conference in Honor of William Craig 13 May 2007
More informationMATHEMATICS: CONCEPTS, AND FOUNDATIONS Vol. II - Model Theory - H. Jerome Keisler
ATHEATCS: CONCEPTS, AND FOUNDATONS Vol. - odel Theory - H. Jerome Keisler ODEL THEORY H. Jerome Keisler Department of athematics, University of Wisconsin, adison Wisconsin U.S.A. Keywords: adapted probability
More informationNAMBA FORCING, WEAK APPROXIMATION, AND GUESSING
NAMBA FORCING, WEAK APPROXIMATION, AND GUESSING SEAN COX AND JOHN KRUEGER Abstract. We prove a variation of Easton s lemma for strongly proper forcings, and use it to prove that, unlike the stronger principle
More informationA Sharp for the Chang Model
A Sharp for the Chang Model William Mitchell wjm@ufl.edu University of Florida February 19, 2011 Inner Model Theory & Large Cardinals A 50 Year Celebration Mitchell (University of Florida) A Sharp for
More informationCOUNTEREXAMPLES TO THE UNIQUE AND COFINAL BRANCHES HYPOTHESES
COUNTEREXAMPLES TO THE UNIQUE AND COFINAL BRANCHES HYPOTHESES ITAY NEEMAN AND JOHN STEEL Abstract. We produce counterexamples to the unique and cofinal branches hypotheses, assuming (slightly less than)
More informationJónsson Properties for Non-Ordinal Sets Under the Axiom of Determinacy
Jónsson Properties for Non-Ordinal Sets Under the Axiom of Determinacy Fifth NY Graduate Student Logic Conference The Jónsson Property For κ a cardinal and n ω, [κ] n = {(α 1,, α n ) κ n : α 1 < < α n
More informationShort Introduction to Admissible Recursion Theory
Short Introduction to Admissible Recursion Theory Rachael Alvir November 2016 1 Axioms of KP and Admissible Sets An admissible set is a transitive set A satisfying the axioms of Kripke-Platek Set Theory
More informationA Sharp for the Chang Model
A Sharp for the Chang Model William Mitchell wjm@ufl.edu University of Florida February 19, 2011 Inner Model Theory & Large Cardinals A 50 Year Celebration Mitchell (University of Florida) A Sharp for
More informationDiamond on successors of singulars
Diamond on successors of singulars ESI workshop on large cardinals and descriptive set theory 18-Jun-09, Vienna Assaf Rinot Tel-Aviv University http://www.tau.ac.il/ rinot 1 Diamond on successor cardinals
More informationThe Vaught Conjecture Do uncountable models count?
The Vaught Conjecture Do uncountable models count? John T. Baldwin Department of Mathematics, Statistics and Computer Science University of Illinois at Chicago May 22, 2005 1 Is the Vaught Conjecture model
More informationPart II. Logic and Set Theory. Year
Part II Year 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2018 60 Paper 4, Section II 16G State and prove the ǫ-recursion Theorem. [You may assume the Principle of ǫ- Induction.]
More informationPropositional and Predicate Logic - VII
Propositional and Predicate Logic - VII Petr Gregor KTIML MFF UK WS 2015/2016 Petr Gregor (KTIML MFF UK) Propositional and Predicate Logic - VII WS 2015/2016 1 / 11 Theory Validity in a theory A theory
More informationThe Absoluteness of Constructibility
Lecture: The Absoluteness of Constructibility We would like to show that L is a model of V = L, or, more precisely, that L is an interpretation of ZF + V = L in ZF. We have already verified that σ L holds
More informationThe Countable Henkin Principle
The Countable Henkin Principle Robert Goldblatt Abstract. This is a revised and extended version of an article which encapsulates a key aspect of the Henkin method in a general result about the existence
More informationSet Theory, Forcing and Real Line
Set Theory, Forcing and Real Line Giorgio Laguzzi March 21, 2013 Abstract We give a very brief survey on ZFC theory (Zermelo-Fraenkel Set Theory) and we present an intuitive introduction to the method
More informationThe length-ω 1 open game quantifier propagates scales
The length-ω 1 open game quantifier propagates scales John R. Steel June 5, 2006 0 Introduction We shall call a set T an ω 1 -tree if only if T α
More informationCLUB GUESSING SEQUENCES NATURAL STRUCTURES IN SET THEORY
Unspecified Journal Volume 00, Number 0, Pages 000 000 S????-????(XX)0000-0 CLUB GUESSING SEQUENCES NATURAL STRUCTURES IN SET THEORY TETSUYA ISHIU Abstract. Natural structures in set theory played key
More informationSuccessive cardinals with the tree property
UCLA March 3, 2014 A classical theorem Theorem (König Infinity Lemma) Every infinite finitely branching tree has an infinite path. Definitions A tree is set T together with an ordering < T which is wellfounded,
More informationOrdinalize! Peter Koepke University of Bonn January 28, Cantor s ordinals extend the standard natural numbers into the transfinite:
Ordinalize! Peter Koepke University of Bonn January 28, 2007 1 Introduction Cantor s ordinals extend the standard natural numbers into the transfinite: 0, 1, 2, 3,..., n, n + 1,... is continued by ω, ω
More informationSET MAPPING REFLECTION
SET MAPPING REFLECTION JUSTIN TATCH MOORE Abstract. In this note we will discuss a new reflection principle which follows from the Proper Forcing Axiom. The immediate purpose will be to prove that the
More informationForcing with matrices of countable elementary submodels
Forcing with matrices of countable elementary submodels Boriša Kuzeljević IMS-JSPS Joint Workshop - IMS Singapore, January 2016 Boriša Kuzeljević (NUS) Matrices of elementary submodels January 2016 1 /
More informationSubversions of forcing classes
Subversions of forcing classes Gunter Fuchs July 19, 2018 1 st Girona conference on inner model theory CUNY College of Staten Island and the CUNY Graduate Center Proper and subproper forcing Proper forcing
More informationAxiomatic set theory. Chapter Why axiomatic set theory?
Chapter 1 Axiomatic set theory 1.1 Why axiomatic set theory? Essentially all mathematical theories deal with sets in one way or another. In most cases, however, the use of set theory is limited to its
More informationFORCING SUMMER SCHOOL LECTURE NOTES
FORCING SUMMER SCHOOL LECTURE NOTES SPENCER UNGER These are the lecture notes for the forcing class in the UCLA Logic Summer School of 2013. The notes would not be what they are without a previous set
More informationLöwenheim-Skolem Theorems, Countable Approximations, and L ω. David W. Kueker (Lecture Notes, Fall 2007)
Löwenheim-Skolem Theorems, Countable Approximations, and L ω 0. Introduction David W. Kueker (Lecture Notes, Fall 2007) In its simplest form the Löwenheim-Skolem Theorem for L ω1 ω states that if σ L ω1
More informationCOLLAPSING FUNCTIONS
COLLAPSING FUNCTIONS ERNEST SCHIMMERLING AND BOBAN VELICKOVIC Abstract. We define what it means for a function on ω 1 to be a collapsing function for λ and show that if there exists a collapsing function
More informationA variant of Namba Forcing
A variant of Namba Forcing Moti Gitik School of Mathematical Sciences Raymond and Beverly Sackler Faculty of Exact Science Tel Aviv University Ramat Aviv 69978, Israel August 0, 009 Abstract Ronald Jensen
More informationSELF-DUAL UNIFORM MATROIDS ON INFINITE SETS
SELF-DUAL UNIFORM MATROIDS ON INFINITE SETS NATHAN BOWLER AND STEFAN GESCHKE Abstract. We extend the notion of a uniform matroid to the infinitary case and construct, using weak fragments of Martin s Axiom,
More informationClassical Theory of Cardinal Characteristics
Classical Theory of Cardinal Characteristics Andreas Blass University of Michigan 22 August, 2018 Andreas Blass (University of Michigan) Classical Theory of Cardinal Characteristics 22 August, 2018 1 /
More informationChain Conditions of Horn and Tarski
Chain Conditions of Horn and Tarski Stevo Todorcevic Berkeley, April 2, 2014 Outline 1. Global Chain Conditions 2. The Countable Chain Condition 3. Chain Conditions of Knaster, Shanin and Szpilrajn 4.
More informationCITS2211 Discrete Structures (2017) Cardinality and Countability
CITS2211 Discrete Structures (2017) Cardinality and Countability Highlights What is cardinality? Is it the same as size? Types of cardinality and infinite sets Reading Sections 45 and 81 84 of Mathematics
More informationHandout: Proof of the completeness theorem
MATH 457 Introduction to Mathematical Logic Spring 2016 Dr. Jason Rute Handout: Proof of the completeness theorem Gödel s Compactness Theorem 1930. For a set Γ of wffs and a wff ϕ, we have the following.
More informationErdös-Rado without choice
Erdös-Rado without choice Thomas Forster Centre for Mathematical Sciences Wilberforce Road Cambridge, CB3 0WB, U.K. March 11, 2007 ABSTRACT A version of the Erdös-Rado theorem on partitions of the unordered
More informationORGANIC AND TIGHT J. CUMMINGS, M. FOREMAN, AND E. SCHIMMERLING
ORGANIC AND TIGHT J. CUMMINGS, M. FOREMAN, AND E. SCHIMMERLING 1. Introduction This report is motivated by the combinatorics of ℵ ω in L where there are canonical examples of scales, square sequences other
More informationPropositional and Predicate Logic - IV
Propositional and Predicate Logic - IV Petr Gregor KTIML MFF UK ZS 2015/2016 Petr Gregor (KTIML MFF UK) Propositional and Predicate Logic - IV ZS 2015/2016 1 / 19 Tableau method (from the previous lecture)
More informationSlow P -point Ultrafilters
Slow P -point Ultrafilters Renling Jin College of Charleston jinr@cofc.edu Abstract We answer a question of Blass, Di Nasso, and Forti [2, 7] by proving, assuming Continuum Hypothesis or Martin s Axiom,
More informationMore Model Theory Notes
More Model Theory Notes Miscellaneous information, loosely organized. 1. Kinds of Models A countable homogeneous model M is one such that, for any partial elementary map f : A M with A M finite, and any
More informationREU 2007 Transfinite Combinatorics Lecture 9
REU 2007 Transfinite Combinatorics Lecture 9 Instructor: László Babai Scribe: Travis Schedler August 10, 2007. Revised by instructor. Last updated August 11, 3:40pm Note: All (0, 1)-measures will be assumed
More informationAlmost Galois ω-stable classes
Almost Galois ω-stable classes John T. Baldwin Paul B. Larson Saharon Shelah March 11, 2015 Abstract Theorem. Suppose that k = (K, k ) is an ℵ 0-presentable abstract elementary class with Löwenheim-Skolem
More informationVAUGHT S THEOREM: THE FINITE SPECTRUM OF COMPLETE THEORIES IN ℵ 0. Contents
VAUGHT S THEOREM: THE FINITE SPECTRUM OF COMPLETE THEORIES IN ℵ 0 BENJAMIN LEDEAUX Abstract. This expository paper introduces model theory with a focus on countable models of complete theories. Vaught
More informationPropositional and Predicate Logic - V
Propositional and Predicate Logic - V Petr Gregor KTIML MFF UK WS 2016/2017 Petr Gregor (KTIML MFF UK) Propositional and Predicate Logic - V WS 2016/2017 1 / 21 Formal proof systems Hilbert s calculus
More informationSouslin s Hypothesis
Michiel Jespers Souslin s Hypothesis Bachelor thesis, August 15, 2013 Supervisor: dr. K.P. Hart Mathematical Institute, Leiden University Contents 1 Introduction 1 2 Trees 2 3 The -Principle 7 4 Martin
More informationThe Ultrapower Axiom implies GCH above a supercompact cardinal
The Ultrapower Axiom implies GCH above a supercompact cardinal arxiv:1810.05036v1 [math.lo] 9 Oct 2018 Gabriel Goldberg October 12, 2018 Abstract We prove that the Generalized Continuum Hypothesis holds
More informationA Basis Theorem for Perfect Sets
A Basis Theorem for Perfect Sets Marcia J. Groszek Theodore A. Slaman November 17, 2000 Abstract We show that if there is a nonconstructible real, then every perfect set has a nonconstructible element,
More informationA NEW LINDELOF SPACE WITH POINTS G δ
A NEW LINDELOF SPACE WITH POINTS G δ ALAN DOW Abstract. We prove that implies there is a zero-dimensional Hausdorff Lindelöf space of cardinality 2 ℵ1 which has points G δ. In addition, this space has
More informationORGANIC AND TIGHT J. CUMMINGS, M. FOREMAN, AND E. SCHIMMERLING
ORGANIC AND TIGHT J. CUMMINGS, M. FOREMAN, AND E. SCHIMMERLING 1. Introduction This paper is motivated by the combinatorics of ℵ ω in L where there are canonical examples of scales, square sequences other
More informationHerbrand Theorem, Equality, and Compactness
CSC 438F/2404F Notes (S. Cook and T. Pitassi) Fall, 2014 Herbrand Theorem, Equality, and Compactness The Herbrand Theorem We now consider a complete method for proving the unsatisfiability of sets of first-order
More informationAxioms for Set Theory
Axioms for Set Theory The following is a subset of the Zermelo-Fraenkel axioms for set theory. In this setting, all objects are sets which are denoted by letters, e.g. x, y, X, Y. Equality is logical identity:
More informationFORCING SUMMER SCHOOL LECTURE NOTES
FORCING SUMMER SCHOOL LECTURE NOTES SPENCER UNGER Abstract. These are the lecture notes for the forcing class in the 2014 UCLA Logic Summer School. They are a revision of the 2013 Summer School notes.
More informationWe begin with a standard definition from model theory.
1 IMPOSSIBLE COUNTING by Harvey M. Friedman Distinguished University Professor of Mathematics, Philosophy, and Computer Science Emeritus Ohio State University Columbus, Ohio 43235 June 2, 2015 DRAFT 1.
More informationADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS
ADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS 1. Cardinal number of a set The cardinal number (or simply cardinal) of a set is a generalization of the concept of the number of elements
More information