An inner model from Ω-logic. Daisuke Ikegami

Size: px
Start display at page:

Download "An inner model from Ω-logic. Daisuke Ikegami"

Transcription

1 An inner model from Ω-logic Daisuke Ikegami Kobe University 12. November 2014

2 Goal & Result Goal Construct a model of set theory which is close to HOD, but easier to analyze.

3 Goal & Result Goal Construct a model of set theory which is close to HOD, but easier to analyze. Theorem (vague version) Under some conditions on large cardinals and Woodin s Ω-logic, one can find a definable class M such that 1 M is a transitive proper class model of ZFC, M HOD, 2 M is invariant under set generic extensions, 3 M contains all the reals in the mice known to exist so far, 4 M is closed under all the mouse operators known to exist so far, and 5 M satisfies GCH.

4 Motivation 1: HOD Conjecture Theorem (Woodin) Let δ be extendible. Then one of the following holds: 1 for every regular γ > δ, γ is measurable in HOD, or 2 for every singular cardinal γ > δ, γ is singular in HOD and (γ + ) HOD = γ +.

5 Motivation 1: HOD Conjecture Theorem (Woodin) Let δ be extendible. Then one of the following holds: 1 for every regular γ > δ, γ is measurable in HOD, or 2 for every singular cardinal γ > δ, γ is singular in HOD and (γ + ) HOD = γ +. Definition (Woodin) HOD Conjecture states that the latter case in the above theorem holds.

6 Motivation 1: HOD Conjecture ctd. 1 HOD Conjecture is connected to Inner Model Program for a supercompact cardinal. 2 HOD Conjecture has an application to the problem on the existence of Reinhardt cardinals in ZF.

7 Motivation 1: HOD Conjecture ctd. 1 HOD Conjecture is connected to Inner Model Program for a supercompact cardinal. 2 HOD Conjecture has an application to the problem on the existence of Reinhardt cardinals in ZF. To solve HOD Conjecture, one would expect a fine analysis of HOD.

8 Motivation 1: HOD Conjecture ctd. 1 HOD Conjecture is connected to Inner Model Program for a supercompact cardinal. 2 HOD Conjecture has an application to the problem on the existence of Reinhardt cardinals in ZF. To solve HOD Conjecture, one would expect a fine analysis of HOD. But HOD is very non-absolute, e.g., one can add any real to HOD in a set generic extension.

9 Motivation 1: HOD Conjecture ctd. 1 HOD Conjecture is connected to Inner Model Program for a supercompact cardinal. 2 HOD Conjecture has an application to the problem on the existence of Reinhardt cardinals in ZF. To solve HOD Conjecture, one would expect a fine analysis of HOD. But HOD is very non-absolute, e.g., one can add any real to HOD in a set generic extension. Goal Construct a model of set theory which is close to HOD but easier to analyze.

10 Motivation 2: Inner Model Theory Question What is the limitation of the current method of Inner Model Theory?

11 Motivation 2: Inner Model Theory Question What is the limitation of the current method of Inner Model Theory? The keyword is Σ 2 1 (ub).

12 Background: Universally Baire sets Definition A set of reals A is universally Baire if for any continuous function f from a compact Hausdorff space X to the reals, f 1 (A) has the Baire property in the space X.

13 Background: Universally Baire sets Definition A set of reals A is universally Baire if for any continuous function f from a compact Hausdorff space X to the reals, f 1 (A) has the Baire property in the space X. Remark 1 Every universally Baire set is Lebesgue measurable and has the Baire property. 2 The collection of universally Baire sets forms a σ-algebra, and it contains all the open sets. So every Borel set is universally Baire.

14 Background: Universally Baire sets ctd. Remark A set of reals A is universally Baire if and only if for any partial order P, there are a set Y and trees T,U on ω Y such that A = p[t] and P p[ť] = R\p[Ǔ].

15 Background: Universally Baire sets ctd. Remark A set of reals A is universally Baire if and only if for any partial order P, there are a set Y and trees T,U on ω Y such that A = p[t] and P p[ť] = R\p[Ǔ]. Using this fact and the trees, one can canonically interpret a ub set A in a set generic extension V[G] (namely p[t] in V[G]). We write A G for this interpreted set in V[G].

16 Background: Universally Baire sets ctd. Remark A set of reals A is universally Baire if and only if for any partial order P, there are a set Y and trees T,U on ω Y such that A = p[t] and P p[ť] = R\p[Ǔ]. Using this fact and the trees, one can canonically interpret a ub set A in a set generic extension V[G] (namely p[t] in V[G]). We write A G for this interpreted set in V[G]. Example 1 Every Π 1 1-set of reals is universally Baire.

17 Background: Universally Baire sets ctd. Remark A set of reals A is universally Baire if and only if for any partial order P, there are a set Y and trees T,U on ω Y such that A = p[t] and P p[ť] = R\p[Ǔ]. Using this fact and the trees, one can canonically interpret a ub set A in a set generic extension V[G] (namely p[t] in V[G]). We write A G for this interpreted set in V[G]. Example 1 Every Π 1 1-set of reals is universally Baire. 2 The following are equivalent: 1 every Π 1 2-set of reals is universally Baire, 2 every set has a sharp.

18 Motivation 2: Inner Model Theory; Σ 2 1 (ub) Definition 1 A formula φ is Σ 2 1 (ub) if it is of the form ( A: universally Baire) (H ω1,,a) ψ, where ψ is a first order formula. 2 A set A H ω1 is Σ 2 1 (ub) if it is defined by a Σ2 1 (ub) formula. 3 A set A H ω1 is 2 1 (ub) in a countable ordinal if there is a countable ordinal α such that both A and H ω1 \A are Σ 2 1 (ub) with parameter α.

19 Motivation 2: Inner Model Theory; Σ 2 1 (ub) Definition 1 A formula φ is Σ 2 1 (ub) if it is of the form ( A: universally Baire) (H ω1,,a) ψ, where ψ is a first order formula. 2 A set A H ω1 is Σ 2 1 (ub) if it is defined by a Σ2 1 (ub) formula. 3 A set A H ω1 is 2 1 (ub) in a countable ordinal if there is a countable ordinal α such that both A and H ω1 \A are Σ 2 1 (ub) with parameter α. Remark 1 All the reals in the mice known to exist so far are 2 1 (ub) in a countable ordinal.

20 Motivation 2: Inner Model Theory; Σ 2 1 (ub) Definition 1 A formula φ is Σ 2 1 (ub) if it is of the form ( A: universally Baire) (H ω1,,a) ψ, where ψ is a first order formula. 2 A set A H ω1 is Σ 2 1 (ub) if it is defined by a Σ2 1 (ub) formula. 3 A set A H ω1 is 2 1 (ub) in a countable ordinal if there is a countable ordinal α such that both A and H ω1 \A are Σ 2 1 (ub) with parameter α. Remark 1 All the reals in the mice known to exist so far are 2 1 (ub) in a countable ordinal. 2 If M is A-closed for every A which is universally Baire and 2 1 (ub), then M is closed under all the mouse operators known to exist so far.

21 Motivation 2: Inner Model Theory; A-closure Definition (A-closure) Let A be universally Baire. An ω-model M of ZFC is A-closed if for any V-generic filter G on a partial order in M, M[G] A G M[G], where A G is the canonical interpretation of A in V[G].

22 Motivation 2: Inner Model Theory; A-closure Definition (A-closure) Let A be universally Baire. An ω-model M of ZFC is A-closed if for any V-generic filter G on a partial order in M, M[G] A G M[G], where A G is the canonical interpretation of A in V[G]. Example 1 For an ω-model M of ZFC, the following are equivalent: M is A-closed for any Π 1 1 -set A, and M is well-founded.

23 Motivation 2: Inner Model Theory; A-closure Definition (A-closure) Let A be universally Baire. An ω-model M of ZFC is A-closed if for any V-generic filter G on a partial order in M, M[G] A G M[G], where A G is the canonical interpretation of A in V[G]. Example 1 For an ω-model M of ZFC, the following are equivalent: M is A-closed for any Π 1 1-set A, and M is well-founded. 2 For an ω-model M of ZFC, the following are equivalent: 1 M is A-closed for every Π 1 2 -set A, and 2 M every set has a sharp.

24 Back to Result Theorem (precise version) Suppose that there are proper class many Woodin cardinals and assume that the Ω-Conjecture with real parameters holds in any set generic extension. Then there is a definable class M such that 1 M is a transitive proper class model of ZFC, M HOD, 2 M is invariant under set generic extensions, 3 the reals in M are exactly those which are 2 1 (ub) in a countable ordinal, 4 M is A-closed for all universally Baire A which are 2 1 (ub), and 5 M satisfies GCH.

25 Inner models from logics Definition Given a logic L with a definability notion, L 0 (L) =, L α+1 (L) = Def L ( (Lα (L), ) ), L γ (L) = α<γl α (L) (γ is limit), L(L) = α On L α (L).

26 Inner models from logics Definition Given a logic L with a definability notion, Example L 0 (L) =, L α+1 (L) = Def L ( (Lα (L), ) ), L γ (L) = α<γl α (L) (γ is limit), L(L) = α On L α (L). When L is first order logic, L(L) is L. When L is full second (or higher) order logic, L(L) is HOD.

27 Inner models from logics Definition Given a logic L with a definability notion, Example L 0 (L) =, L α+1 (L) = Def L ( (Lα (L), ) ), L γ (L) = α<γl α (L) (γ is limit), L(L) = α On L α (L). When L is first order logic, L(L) is L. When L is full second (or higher) order logic, L(L) is HOD. In this we talk, we will use Woodin s Ω-logic for a desired inner model M.

28 Background 2; Ω-logic Definition Let φ[a] be a Π 2 sentence with a set parameter a in the language of set theory. 1 We say φ[a] is Ω-valid if φ[a] holds.

29 Background 2; Ω-logic Definition Let φ[a] be a Π 2 sentence with a set parameter a in the language of set theory. 1 We say φ[a] is Ω-valid if φ[a] holds. 2 Suppose that a is a real. Then we say φ is Ω-provable if there is a universally Baire set A such that if M is a countable transitive model of ZFC with a M and M is A-closed, then M φ.

30 Background 2; Ω-logic Definition Let φ[a] be a Π 2 sentence with a set parameter a in the language of set theory. 1 We say φ[a] is Ω-valid if φ[a] holds. 2 Suppose that a is a real. Then we say φ is Ω-provable if there is a universally Baire set A such that if M is a countable transitive model of ZFC with a M and M is A-closed, then M φ. Definition The Ω-Conjecture with real parameters states that φ is Ω-valid if and only if φ is Ω-provable for all φ[a]. Point: One can reduce the complexity of Ω-valid Π 2 sentences to Σ 2 1 (ub)

31 Inner models from logics: the model L Ω Definition Let φ be a Σ 2 formula and ψ be a Π 2 formula in the language of set theory. We say (φ,ψ) is a ZFC 2 -pair if ZFC ( x) φ( x) ψ( x).

32 Inner models from logics: the model L Ω Definition Let φ be a Σ 2 formula and ψ be a Π 2 formula in the language of set theory. We say (φ,ψ) is a ZFC 2 -pair if ZFC ( x) φ( x) ψ( x). Definition Let A be a set, a A <ω, and (φ,ψ) be a ZFC 2 -pair. Then the triple (φ,ψ, a) is suitable to A if for any element x of A, either φ[x, a,a] or φ[x, a,a] holds.

33 Inner models from logics: the model L Ω ctd. Definition 1 Let (φ,ψ, a) be suitable to A. Then a set X A is Ω-definable via (φ,ψ, a) if X = {x A φ[x, a,a]}.

34 Inner models from logics: the model L Ω ctd. Definition 1 Let (φ,ψ, a) be suitable to A. Then a set X A is Ω-definable via (φ,ψ, a) if X = {x A φ[x, a,a]}. 2 Def Ω (A) is the collection of Ω-definable subsets of A via some (φ,ψ, a) suitable to A.

35 Inner models from logics: the model L Ω ctd. Definition 1 Let (φ,ψ, a) be suitable to A. Then a set X A is Ω-definable via (φ,ψ, a) if X = {x A φ[x, a,a]}. 2 Def Ω (A) is the collection of Ω-definable subsets of A via some (φ,ψ, a) suitable to A. Definition L Ω 0 =, L Ω ( α+1 = Def Ω (L Ω α, ) ), L Ω γ = α<γl Ω α (γ is limit), L Ω = L Ω α. α On

36 The model L Ω ; basic properties Observation L Ω HOD.

37 The model L Ω ; basic properties Observation L Ω HOD. Proposition L Ω is an inner model of ZF. Point: Def Ω (A) Def FOL (A).

38 The model L Ω ; basic properties Observation L Ω HOD. Proposition L Ω is an inner model of ZF. Point: Def Ω (A) Def FOL (A). Observation L Ω = (L Ω ) VP for any partial order P assuming that there are proper class many Woodin cardinals.

39 The model L Ω ; basic properties Observation L Ω HOD. Proposition L Ω is an inner model of ZF. Point: Def Ω (A) Def FOL (A). Observation L Ω = (L Ω ) VP for any partial order P assuming that there are proper class many Woodin cardinals. To show: Def Ω (A) = ( Def Ω (A) ) V P for any set A. : Easy. : Use the stationary tower forcing Q <δ.

40 The model L Ω ; basic analysis Lemma (Maximality) Suppose that there are proper class many Woodin cardinals. Then 1 L Ω contains all the reals which are 2 1 (ub) in a countable ordinal, and 2 L Ω is A-closed for any set of reals A which is universally Baire and 2 1 (ub).

41 The model L Ω ; basic analysis Lemma (Maximality) Suppose that there are proper class many Woodin cardinals. Then 1 L Ω contains all the reals which are 2 1 (ub) in a countable ordinal, and 2 L Ω is A-closed for any set of reals A which is universally Baire and 2 1 (ub). Points: One can express a 2 1 (ub) statement in (H δ + 0, ) where δ 0 is the least Woodin cardinal, in all set generic extensions in a uniform way.

42 The model L Ω ; basic analysis ctd. Lemma (Choice) Suppose that there are proper class many Woodin cardinals and assume that the Ω-Conjecture with real parameters holds in any set generic extension. Then L Ω is a model of AC.

43 The model L Ω ; basic analysis ctd. Lemma (Choice) Suppose that there are proper class many Woodin cardinals and assume that the Ω-Conjecture with real parameters holds in any set generic extension. Then L Ω is a model of AC. Points: 1 Given an ordinal α, let < α be the canonical well-order on L Ω α. Then < α is 2 1 (ub) with the parameter LΩ α in any sufficiently large set generic extension. 2 Using Lemma (Maximality), one can show that < α is in L(Ω) for all α.

44 The model L Ω ; GCH Theorem Suppose that there are proper class many Woodin cardinals and assume that the Ω-Conjecture with real parameters holds in any set generic extension. Then L Ω satisfies GCH.

45 The model L Ω ; GCH Theorem Suppose that there are proper class many Woodin cardinals and assume that the Ω-Conjecture with real parameters holds in any set generic extension. Then L Ω satisfies GCH. For CH in L Ω : Lemma The reals in L Ω are exactly those which are 2 1 (ub) in a countable ordinal. Moreover, in V, there is a good Σ 2 1 (ub) well-order of the reals in LΩ.

46 The model L Ω ; GCH Theorem Suppose that there are proper class many Woodin cardinals and assume that the Ω-Conjecture with real parameters holds in any set generic extension. Then L Ω satisfies GCH. For CH in L Ω : Lemma The reals in L Ω are exactly those which are 2 1 (ub) in a countable ordinal. Moreover, in V, there is a good Σ 2 1 (ub) well-order of the reals in LΩ. Then using the Basis Theorem for 2 1 (ub), for a given real x in LΩ, one can pick a real in L Ω which codes the initial segment of x w.r.t. this well-order.

47 The model L Ω ; GCH Theorem Suppose that there are proper class many Woodin cardinals and assume that the Ω-Conjecture with real parameters holds in any set generic extension. Then L Ω satisfies GCH. For CH in L Ω : Lemma The reals in L Ω are exactly those which are 2 1 (ub) in a countable ordinal. Moreover, in V, there is a good Σ 2 1 (ub) well-order of the reals in LΩ. Then using the Basis Theorem for 2 1 (ub), for a given real x in LΩ, one can pick a real in L Ω which codes the initial segment of x w.r.t. this well-order. For 2 κ = κ + in L Ω : Prove CH in (L Ω ) Coll(ω,κ) in the same way.

48 Summary Theorem Suppose that there are proper class many Woodin cardinals and assume that the Ω-Conjecture with real parameters holds in any set generic extension. Then there is a definable class M such that 1 M is a transitive proper class model of ZFC, M HOD, 2 M is invariant under set generic extensions, 3 the reals in M are exactly those which are 2 1 (ub) in a countable ordinal, 4 M is A-closed for all universally Baire A which are 2 1 (ub), and 5 M satisfies GCH.

49 Questions 1 Is there any measurable cardinal in L Ω? 2 Does the hierarchy (L Ω α α Ord) have some weak condensation property?

Trees and generic absoluteness

Trees 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 information

Generalizing Gödel s Constructible Universe:

Generalizing 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 information

Optimal generic absoluteness results from strong cardinals

Optimal 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 information

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

The 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 information

UNIVERSALLY BAIRE SETS AND GENERIC ABSOLUTENESS TREVOR M. WILSON

UNIVERSALLY 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 information

The modal logic of forcing

The 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 information

Inner models from extended logics

Inner 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 information

Unsolvable problems, the Continuum Hypothesis, and the nature of infinity

Unsolvable 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 information

The Absoluteness of Constructibility

The 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 information

The constructible universe

The 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 information

arxiv: v1 [math.lo] 7 Dec 2017

arxiv: 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 information

Forcing Axioms and Inner Models of Set Theory

Forcing 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 information

Projective well-orderings of the reals and forcing axioms

Projective 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 information

A Sharp for the Chang Model

A 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 information

Large Cardinals and Higher Degree Theory

Large 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 information

Gödel s Programm and Ultimate L

Gö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 information

A Sharp for the Chang Model

A 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 information

Cardinal Preserving Elementary Embeddings

Cardinal Preserving Elementary Embeddings Outline Andrés E. Department of Mathematics California Institute of Technology XIII SLALM, Oaxaca, México, August 2006 Outline Outline 1 : Forcing axioms and inner models 2 Inner models M with ω1 M = ω

More information

DESCRIPTIVE INNER MODEL THEORY, LARGE CARDINALS, AND COMBINATORICS RESEARCH STATEMENT NAM TRANG

DESCRIPTIVE INNER MODEL THEORY, LARGE CARDINALS, AND COMBINATORICS RESEARCH STATEMENT NAM TRANG DESCRIPTIVE INNER MODEL THEORY, LARGE CARDINALS, AND COMBINATORICS RESEARCH STATEMENT NAM TRANG My research interest is in mathematical logic and set theory. My current research focuses on studying the

More information

Violating the Singular Cardinals Hypothesis Without Large Cardinals

Violating the Singular Cardinals Hypothesis Without Large Cardinals Violating the Singular Cardinals Hypothesis Without Large Cardinals Talk at the University of Bristol by Peter Koepke (Bonn), joint work with Moti Gitik (Jerusalem) November 29, 2010 Cantor s Continuum

More information

The Continuum Hypothesis, Part II

The 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 information

Set Theory and the Foundation of Mathematics. June 19, 2018

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 information

Definably amenable groups in NIP

Definably amenable groups in NIP Definably amenable groups in NIP Artem Chernikov (Paris 7) Lyon, 21 Nov 2013 Joint work with Pierre Simon. Setting T is a complete first-order theory in a language L, countable for simplicity. M = T a

More information

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

October 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 information

Tame definable topological dynamics

Tame definable topological dynamics Tame definable topological dynamics Artem Chernikov (Paris 7) Géométrie et Théorie des Modèles, 4 Oct 2013, ENS, Paris Joint work with Pierre Simon, continues previous work with Anand Pillay and Pierre

More information

Set Theory and Indiscernibles. Ali Enayat. IPM Logic Conference

Set 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 information

Statue of Aristotle at the Aristotle University of Thessaloniki, Greece

Statue of Aristotle at the Aristotle University of Thessaloniki, Greece Statue of Aristotle at the Aristotle University of Thessaloniki, Greece Is the amalgamation property for L ω1,ω-sentences absolute for transitive models of ZFC? Logic Seminar - UIC 2018 02 01 Ioannis (Yiannis)

More information

Violating the Singular Cardinals Hypothesis Without Large Cardinals

Violating the Singular Cardinals Hypothesis Without Large Cardinals Violating the Singular Cardinals Hypothesis Without Large Cardinals CUNY Logic Workshop, November 18, 2011 by Peter Koepke (Bonn); joint work with Moti Gitik (Tel Aviv) Easton proved that the behavior

More information

Diamond, non-saturation, and weak square principles

Diamond, 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 information

GROUPS WITH UNBOUNDED POTENTIAL AUTOMORPHISM TOWER HEIGHTS

GROUPS WITH UNBOUNDED POTENTIAL AUTOMORPHISM TOWER HEIGHTS GROUPS WITH UNBOUNDED POTENTIAL AUTOMORPHISM TOWER HEIGHTS PHILIPP LÜCKE Abstract. We show that it is consistent with the axioms of ZFC that there exists an infinite centreless group G with the property

More information

A NEW LINDELOF SPACE WITH POINTS G δ

A 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 information

Absolutely ordinal definable sets

Absolutely ordinal definable sets Absolutely ordinal definable sets John R. Steel University of California, Berkeley May 2017 References: (1) Gödel s program, in Interpreting Gödel, Juliette Kennedy ed., Cambridge Univ. Press 2014. (2)

More information

WHY 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? 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 information

Classical Theory of Cardinal Characteristics

Classical 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 information

Descriptive inner model theory

Descriptive inner model theory Descriptive inner model theory Grigor Sargsyan Department of Mathematics Rutgers University Hill Center for the Mathematical Sciences 110 Frelinghuysen Rd. Piscataway, NJ 08854 USA http://math.rutgers.edu/

More information

A simple maximality principle

A 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 information

The Seed Order. Gabriel Goldberg. October 8, 2018

The Seed Order. Gabriel Goldberg. October 8, 2018 The Seed Order arxiv:1706.00831v1 [math.lo] 2 Jun 2017 1 Introduction Gabriel Goldberg October 8, 2018 This paper is an exposition of the basic theory of the seed order, serving as a companion paper to

More information

A variant of Namba Forcing

A 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 information

GREGORY TREES, THE CONTINUUM, AND MARTIN S AXIOM

GREGORY 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 information

MAGIC Set theory. lecture 6

MAGIC Set theory. lecture 6 MAGIC Set theory lecture 6 David Asperó Delivered by Jonathan Kirby University of East Anglia 19 November 2014 Recall: We defined (V : 2 Ord) by recursion on Ord: V 0 = ; V +1 = P(V ) V = S {V : < } if

More information

CANONICALIZATION BY ABSOLUTENESS

CANONICALIZATION BY ABSOLUTENESS CANONICALIZATION BY ABSOLUTENESS WILLIAM CHAN Abstract. This note will give the argument of Neeman and Norwood to show Σ 1 1 (Π1 1 or 1 1 ) canonicalization of equivalence relation in L(R) with all Σ 1

More information

Borel cardinals and Ramsey ultrafilters (draft of Sections 1-3)

Borel cardinals and Ramsey ultrafilters (draft of Sections 1-3) Borel cardinals and Ramsey ultrafilters (draft of Sections 1-3) Richard Ketchersid Paul Larson Jindřich Zapletal May 17, 2012 Abstract This is a draft of the first three sections of a paper in preparation

More information

Forcing axioms and inner models

Forcing axioms and inner models Outline Andrés E. Department of Mathematics California Institute of Technology Boise State University, February 27 2008 Outline Outline 1 Introduction 2 Inner models M with ω1 M = ω 1 Inner models M with

More information

SMALL SUBSETS OF THE REALS AND TREE FORCING NOTIONS

SMALL SUBSETS OF THE REALS AND TREE FORCING NOTIONS SMALL SUBSETS OF THE REALS AND TREE FORCING NOTIONS MARCIN KYSIAK AND TOMASZ WEISS Abstract. We discuss the question which properties of smallness in the sense of measure and category (e.g. being a universally

More information

VARIATIONS FOR SEPARATING CLUB GUESSING PRINCIPLES

VARIATIONS 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 information

The Ultrapower Axiom implies GCH above a supercompact cardinal

The 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 information

FUNDAMENTALS OF REAL ANALYSIS

FUNDAMENTALS OF REAL ANALYSIS ÜO i FUNDAMENTALS OF REAL ANALYSIS James Foran University of Missouri Kansas City, Missouri Marcel Dekker, Inc. New York * Basel - Hong Kong Preface iii 1.1 Basic Definitions and Background Material 1

More information

Outer Model Satisfiability. M.C. (Mack) Stanley San Jose State

Outer Model Satisfiability. M.C. (Mack) Stanley San Jose State Outer Model Satisfiability M.C. (Mack) Stanley San Jose State The Universe of Pure Sets V 0 = V α+1 = P(V α ) = { x : x V α } V λ = V α, λ a limit α

More information

NAM TRANG TREVOR WILSON. September 16, 2016

NAM TRANG TREVOR WILSON. September 16, 2016 DETERMINACY FROM STRONG COMPACTNESS OF ω 1 NAM TRANG TREVOR WILSON September 16, 2016 Abstract In the absence of the Axiom of Choice, the small cardinal ω 1 can exhibit properties more usually associated

More information

The Vaught Conjecture Do uncountable models count?

The 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 information

Diagonalize This. Iian Smythe. Department of Mathematics Cornell University. Olivetti Club November 26, 2013

Diagonalize This. Iian Smythe. Department of Mathematics Cornell University. Olivetti Club November 26, 2013 Diagonalize This Iian Smythe Department of Mathematics Cornell University Olivetti Club November 26, 2013 Iian Smythe (Cornell) Diagonalize This Nov 26, 2013 1 / 26 "Surprised Again on the Diagonal", Lun-Yi

More information

ITERATING ALONG A PRIKRY SEQUENCE

ITERATING ALONG A PRIKRY SEQUENCE ITERATING ALONG A PRIKRY SEQUENCE SPENCER UNGER Abstract. In this paper we introduce a new method which combines Prikry forcing with an iteration between the Prikry points. Using our method we prove from

More information

Proof Theory and Subsystems of Second-Order Arithmetic

Proof 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 information

Extremely large cardinals in the absence of Choice

Extremely 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 information

SELF-DUAL UNIFORM MATROIDS ON INFINITE SETS

SELF-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 information

Tallness and Level by Level Equivalence and Inequivalence

Tallness 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 information

HOD IN INNER MODELS WITH WOODIN CARDINALS

HOD IN INNER MODELS WITH WOODIN CARDINALS HOD IN INNER MODELS WITH WOODIN CARDINALS SANDRA MÜLLER AND GRIGOR SARGSYAN Abstract. We analyze the hereditarily ordinal definable sets HOD in the canonical inner model with n Woodin cardinals M n(x,

More information

Löwenheim-Skolem Theorems, Countable Approximations, and L ω. David W. Kueker (Lecture Notes, Fall 2007)

Lö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 information

What are Axioms of Set Theory?

What are Axioms of Set Theory? Set-theorists use the term Axiom (of Set Theory) quite freely. What do they mean by it? Examples Axioms of ZFC: Axiom of Extensionality Pairing Axiom Separation Axiom Union Axiom Powerset Axiom Axiom of

More information

Measures in model theory

Measures in model theory Measures in model theory Anand Pillay University of Leeds Logic and Set Theory, Chennai, August 2010 Introduction I I will discuss the growing use and role of measures in pure model theory, with an emphasis

More information

Inner Models from Extended Logics

Inner Models from Extended Logics Inner Models from Extended Logics Juliette Kennedy Helsinki Menachem Magidor Jerusalem Jouko Väänänen Helsinki and Amsterdam January 23, 2016 Abstract If we replace first order logic by second order logic

More information

WHAT NFU KNOWS ABOUT CANTORIAN OBJECTS. Ali Enayat. NF 70th Anniversary Meeting. (May 2007, Cambridge)

WHAT NFU KNOWS ABOUT CANTORIAN OBJECTS. Ali Enayat. NF 70th Anniversary Meeting. (May 2007, Cambridge) WHAT NFU KNOWS ABOUT CANTORIAN OBJECTS Ali Enayat NF 70th Anniversary Meeting (May 2007, Cambridge) BIRTH OF NFU Jensen s variant NF U of NF is obtained by modifying the extensionality axiom so as to allow

More information

FORCING WITH SEQUENCES OF MODELS OF TWO TYPES

FORCING 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 information

The hierarchy of second-order set theories between GBC and KM and beyond

The hierarchy of second-order set theories between GBC and KM and beyond The hierarchy of second-order set theories between GBC and KM and beyond Joel David Hamkins City University of New York CUNY Graduate Center Mathematics, Philosophy, Computer Science College of Staten

More information

Inner model theoretic geology

Inner model theoretic geology Inner model theoretic geology Gunter Fuchs Ralf Schindler November 18, 2014 Abstract One of the basic concepts of set theoretic geology is the mantle of a model of set theory V: it is the intersection

More information

tp(c/a) tp(c/ab) T h(m M ) is assumed in the background.

tp(c/a) tp(c/ab) T h(m M ) is assumed in the background. Model Theory II. 80824 22.10.2006-22.01-2007 (not: 17.12) Time: The first meeting will be on SUNDAY, OCT. 22, 10-12, room 209. We will try to make this time change permanent. Please write ehud@math.huji.ac.il

More information

DOWNLOAD PDF FOR SET THEORY

DOWNLOAD PDF FOR SET THEORY Chapter 1 : Discrete Mathematics/Set theory - Wikibooks, open books for an open world Set theory is a branch of mathematical logic that studies sets, which informally are collections of theinnatdunvilla.comgh

More information

TOPICS IN SET THEORY: Example Sheet 2

TOPICS IN SET THEORY: Example Sheet 2 TOPICS IN SET THEORY: Example Sheet 2 Department of Pure Mathematics and Mathematical Statistics, University of Cambridge Michaelmas 2013-2014 Dr Oren Kolman ok261@dpmms.cam.ac.uk 1 (i) Suppose that x

More information

Contributions to Descriptive Inner Model Theory. by Trevor Miles Wilson

Contributions to Descriptive Inner Model Theory. by Trevor Miles Wilson Contributions to Descriptive Inner Model Theory by Trevor Miles Wilson A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in Mathematics in the

More information

Model Theory of Second Order Logic

Model 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 information

COLLAPSING FUNCTIONS

COLLAPSING 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 information

A Crash Course in Topological Groups

A Crash Course in Topological Groups A Crash Course in Topological Groups Iian B. Smythe Department of Mathematics Cornell University Olivetti Club November 8, 2011 Iian B. Smythe (Cornell) Topological Groups Nov. 8, 2011 1 / 28 Outline 1

More information

Six lectures on the stationary tower

Six lectures on the stationary tower Six lectures on the stationary tower Paul B. Larson November 19, 2012 1 The stationary tower 1.1 Definition. Let X be a nonempty set. A set c P(X) is club in P(X) if there is a function f : X

More information

Modal Logic of Forcing Classes

Modal Logic of Forcing Classes Outline CUNY Graduate Center Department of Mathematics March 11, 2016 Outline Outline 1 Outline 1 Modal Logic Background Modal Axioms K (ϕ ψ) ( ϕ ψ) T ϕ ϕ 4 ϕ ϕ.2 ϕ ϕ.3 ( ϕ ψ) [(ϕ ψ) (ψ ϕ)] 5 ϕ ϕ Modal

More information

From Constructibility and Absoluteness to Computability and Domain Independence

From Constructibility and Absoluteness to Computability and Domain Independence From Constructibility and Absoluteness to Computability and Domain Independence Arnon Avron School of Computer Science Tel Aviv University, Tel Aviv 69978, Israel aa@math.tau.ac.il Abstract. Gödel s main

More information

CCC Forcing and Splitting Reals

CCC Forcing and Splitting Reals CCC Forcing and Splitting Reals Boban Velickovic Equipe de Logique, Université de Paris 7 2 Place Jussieu, 75251 Paris, France Abstract Prikry asked if it is relatively consistent with the usual axioms

More information

Axiomatic set theory and its applications

Axiomatic set theory and its applications Axiomatic set theory and its applications last update:2018 10 26 November 5 (Mon) 10:00 10:10 Morning Session 10:10 11:10 opening Chair:Hiroaki Minami minicourse part 1: TBA 11:20 12:00 David Chodounský

More information

Woodin s axiom ( ), or Martin s Maximum, or both?

Woodin s axiom ( ), or Martin s Maximum, or both? Woodin s axiom ( ), or Martin s Maximum, or both? Ralf Schindler This paper is dedicated to W. Hugh Woodin on the occasion of his 60 th birthday. Abstract. We present and discuss a new axiom, Martin s

More information

Handbook of Set Theory. Foreman, Kanamori, and Magidor (eds.)

Handbook 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 information

Maharam Algebras. Equipe de Logique, Université de Paris 7, 2 Place Jussieu, Paris, France

Maharam Algebras. Equipe de Logique, Université de Paris 7, 2 Place Jussieu, Paris, France Maharam Algebras Boban Veličković Equipe de Logique, Université de Paris 7, 2 Place Jussieu, 75251 Paris, France Abstract Maharam algebras are complete Boolean algebras carrying a positive continuous submeasure.

More information

Higher dimensional Ellentuck spaces

Higher dimensional Ellentuck spaces Higher dimensional Ellentuck spaces Natasha Dobrinen University of Denver Forcing and Its Applications Retrospective Workshop Fields Institute, April 1, 2015 Dobrinen Higher dimensional Ellentuck spaces

More information

ALL UNCOUNTABLE CARDINALS IN THE GITIK MODEL ARE ALMOST RAMSEY AND CARRY ROWBOTTOM FILTERS

ALL UNCOUNTABLE CARDINALS IN THE GITIK MODEL ARE ALMOST RAMSEY AND CARRY ROWBOTTOM FILTERS ALL UNCOUNTABLE CARDINALS IN THE GITIK MODEL ARE ALMOST RAMSEY AND CARRY ROWBOTTOM FILTERS ARTHUR W. APTER, IOANNA M. DIMITRIOU, AND PETER KOEPKE Abstract. Using the analysis developed in our earlier paper

More information

MEASURABLE 3-COLORINGS OF ACYCLIC GRAPHS CLINTON T. CONLEY AND BENJAMIN D. MILLER

MEASURABLE 3-COLORINGS OF ACYCLIC GRAPHS CLINTON T. CONLEY AND BENJAMIN D. MILLER MEASURABLE 3-COLORINGS OF ACYCLIC GRAPHS CLINTON T. CONLEY AND BENJAMIN D. MILLER Abstract. This is the first of two lectures on measurable chromatic numbers given in June 2010 at the University of Barcelona.

More information

SEPARATION IN CLASS FORCING EXTENSIONS. Contents

SEPARATION IN CLASS FORCING EXTENSIONS. Contents SEPARATION IN CLASS FORCING EXTENSIONS PETER HOLY, REGULA KRAPF, AND PHILIPP SCHLICHT Abstract. We investigate the validity of instances of the Separation scheme in generic extensions for class forcing.

More information

Logic and Games SS 2009

Logic and Games SS 2009 Logic and Games SS 2009 Prof. Dr. Erich Grädel Łukasz Kaiser, Tobias Ganzow Mathematische Grundlagen der Informatik RWTH Aachen c b n d This work is licensed under: http://creativecommons.org/licenses/by-nc-nd/3.0/de/

More information

Type decompositions in NIP theories

Type decompositions in NIP theories École Normale Supérieure, Paris Logic Colloquium 2012, Manchester Definition A formula φ(x; y) has the independence property if one can find some infinite set B such that for every C B, there is y C such

More information

Modal Logic XXI. Yanjing Wang

Modal Logic XXI. Yanjing Wang Modal Logic XXI Yanjing Wang Department of Philosophy, Peking University May 17th, 2017 Advanced Modal Logic (2017 Spring) 1 Completeness via Canonicity Soundness and completeness Definition (Soundness)

More information

Large Cardinals and Lebesgue Measurability

Large Cardinals and Lebesgue Measurability Large Cardinals and Lebesgue Measurability 1 Abstract This essay explores the connection between large cardinals and regularity properties of sets of real numbers - specifically, their Lebesgue measurability.

More information

Univalent Foundations and Set Theory

Univalent Foundations and Set Theory Univalent Foundations and Set Theory Talk by Vladimir Voevodsky from Institute for Advanced Study in Princeton, NJ. May 8, 2013 1 Univalent foundations - are based on a class of formal deduction systems

More information

Logical Theories of Trees

Logical Theories of Trees Logical Theories of Trees by Ruaan Kellerman under the supervision of Prof. V. F. Goranko Prof. M. Möller School of Mathematics University of the Witwatersrand Johannesburg South Africa A thesis submitted

More information

Set Theory, Forcing and Real Line

Set 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 information

Boolean-Valued Models and Forcing

Boolean-Valued Models and Forcing Boolean-Valued Models and Forcing Abstract This introduction to forcing is based on Chapters 5 6 in T. J. Jech s book The Axiom of Choice and is written primarily for the Fraenkel-Mostowski Models reading

More information

VC-dimension in model theory and other subjects

VC-dimension in model theory and other subjects VC-dimension in model theory and other subjects Artem Chernikov (Paris 7 / MSRI, Berkeley) UCLA, 2 May 2014 VC-dimension Let F be a family of subsets of a set X. VC-dimension Let F be a family of subsets

More information

Clearly C B, for every C Q. Suppose that we may find v 1, v 2,..., v n

Clearly C B, for every C Q. Suppose that we may find v 1, v 2,..., v n 10. Algebraic closure Definition 10.1. Let K be a field. The algebraic closure of K, denoted K, is an algebraic field extension L/K such that every polynomial in K[x] splits in L. We say that K is algebraically

More information

A New Notion of Cardinality for Countable First Order Theories

A New Notion of Cardinality for Countable First Order Theories A New Notion of Cardinality for Countable First Order Theories Douglas Ulrich, Richard Rast, and Michael C. Laskowski Department of Mathematics University of Maryland, College Park October 19, 2015 Abstract

More information

Independence in tame abstract elementary classes

Independence in tame abstract elementary classes Independence in tame abstract elementary classes Sebastien Vasey Carnegie Mellon University January 11, 2015 Joint Mathematics Meeting AMS-ASL Special Session on Beyond First-Order Model Theory San Antonio,

More information

Wadge-like classifications of real valued functions. Takayuki Kihara

Wadge-like classifications of real valued functions. Takayuki Kihara Wadge-like classifications of real valued functions (The Day-Downey-Westrick reducibilities for R-valued functions) Takayuki Kihara Nagoya University, Japan Aspects of Computation: in celebration of the

More information

The Proper Forcing Axiom

The Proper Forcing Axiom Proceedings of the International Congress of Mathematicians Hyderabad, India, 2010 The Proper Forcing Axiom Justin Tatch Moore This article is dedicated to Stephanie Rihm Moore. The author s preparation

More information

The rôle of endofunctors in DST

The rôle of endofunctors in DST The rôle of endofunctors in DST Arno Pauly Clare College, University of Cambridge DST in Paris 2014 The talk in a nutshell Represented spaces are an excellent setting for descriptive set (function) theory.

More information

INDEPENDENCE OF THE CONTINUUM HYPOTHESIS

INDEPENDENCE OF THE CONTINUUM HYPOTHESIS INDEPENDENCE OF THE CONTINUUM HYPOTHESIS CAPSTONE MATT LUTHER 1 INDEPENDENCE OF THE CONTINUUM HYPOTHESIS 2 1. Introduction This paper will summarize many of the ideas from logic and set theory that are

More information