Embedding Trees in the Rationals

Size: px
Start display at page:

Download "Embedding Trees in the Rationals"

Transcription

1 Proceedings of the National Academy of Sciences Vol. 67, No. 4, pp , December 1970 Embedding Trees in the Rationals J. Baumgartner,* J. Malitz, and W. Reinhardt DARTMOUTH COLLEGE,* HANOVER, NEW HAMPSHIRE; AND DEPARTMENT OF MATHEMATICS, UNIVERSITY OF COLORADO, BOULDER, COLO Communicated by S. Ulam, September 4, 1970 Abstract. An example is presented of a simple algebraic statement whose truth cannot be decided within the framework of ordinary mathematics, i.e., the statement is independent of the usual axiomatizations of set theory. The statement asserts that every tree-like ordering of power equal to or less than the first uncountable cardinal can be embedded-homomorphically into the rationals. In this paper, we show (see also refs. 1-3) that the following assertion A, which implies Souslin's hypothesis, is independent of the axioms of set theory (more precisely, both A and its negation are relatively consistent with ZFC, the Zermelo-Fraenkel axioms plus the axiom of choice). A. If T is a tree-like partial order in which every chain is countable and if T has cardinality N1, then there is an embeddingf: T-V. Q (Q the rational numbers) such that x < y impliesf(x) < f(y). The following fragment of A already implies Souslin's hypothesis. B. Every Aronszajn tree can be embedded in the rationals. Questions about embeddings of trees into linear orders have been discussed before (see Kurepa4 and Johnston5). Definition 1: Let P be a partial order. (a) P is tree-like iff for each q E P, P, = { x E P: x < q} is linearly ordered. P is a tree iff each Pq is well-ordered. (b) x,y E P are compatible if there is r C P with xy < r, otherwise x,y are incompatible. (c) C C P is an antichain iff for all x,y C C, if x $ y then xy are incompatible. (d) C C P is a chain iff C is linearly ordered. (e) If T is a tree, the order l(t) of t C T is the order type of { s E T: s < t}. (f) An Aronszajn tree is a tree with no uncountable chains in which each level {t: I(t) = a} (a C w') is countable, such that above each point t there are points s of every countable order > 1(t). (g) A Souslin tree is an Aronszajn tree which contains no uncountable antichains. (h) P is embeddable in the rationale iff there is a function f: P Q preserving strict order, i.e., such that x < y impliesf(x) <f(y). Note thatf is not required to be one-one. We will write card x for the cardinality of x. 1748

2 VOL. 67, 1970 TREE-EMBEDDING IN RATIONALS 1749 Notice that if P is tree-like then C C P is an antichain iff for all xy C C, neither x < y nor y < x. Souslin's hypothesis (SH) asserts that there are no Souslin trees. It is easy to see that if T is an Aronszajn tree then card T = Rl. Hence A implies B. Next we assert that B implies Souslin's hypothesis. Suppose T is a Souslin tree and f: T -- Q is anl embedding. Then T = U { Tr: r E Q}, where Tr = { p E T: f(p) = r}, so some Tr is uncountable. But it is easy to see that each Tr is an antichain, contradicting the fact that T is Souslin. Since the negation of Souslin's hypothesis is known to be consistent (see Jech6 and Tennenbaum7), it follows that the negation of B (and hence the negation of A) is consistent. In Theorem 4 below, we show that A follows from Martin's Axiom together with K, < 2Po. Since Martin's Axiom is known to be consistent with N, < 2No (see Solovay and Tennenbaum8), A is consistent, and hence A is independent of the axioms of set theory. Baumgartner first showed the consistency of A for trees; Malitz and Reinhardt independently of Baumgartner (but not of each other) showed this and the consistency of A. Later Baumgartner observed that A follows from the special case for trees. Several other results concerning embeddings and decompositions of trees have been obtained by Baumgartner and will appear in another paper. (Some of these results are announced in ref. 2.) Laver has shown (in ZFC) that there is a tree of power 2Ho embeddable in the reals but not in the rationals and such that each uncountable subset contains an uncountable antichain. (Subsequently Galvin found an example of such a tree which cannot be embedded in the reals. Proofs of these results may be found in ref. 1.) Thus the negation of A This, together with Jensen's recent result (un- is provable in ZFC + 2No = K. published) that SH is consistent with 21o = K, shows that A does not follow from SH. The question whether B follows from SH is open. The Laver example also shows that RI cannot be replaced by 2PO in A. The following partial order (due to Sierpifiski) shows that the condition in A that T be tree-like cannot be weakened to T an arbitrary partial order. Let P = { re,: a C coi} be an uncountable set of distinct reals. Put ra < r, iff ra < r, in the usual ordering of the reals, and also a < B3. It is easy to see that every set of pairwise incomparable elements of P is countable and hence, as in the proof that B implies SH, P cannot be embedded in the rationals. Definition 2: (a) Let P be a partial order. A set D is called P-dense if D C P and for all p P there is q > p such that q E D. (b) A subset G of P is called P-generic over M iff the following three conditions hold. (i) if p,q E G then there is r E G with p,q < r (ii) if q & G and p < q thenp E G (iii) if D C M is P-dense, then G n D $ 0. Martin's Axiom. If P is a partial order in which every antichain is countable, and if M is any set of cardinality <2NO, then there is a set G C P such that G is P- generic over M. For a general discussion of Martin's Axiom and its consequences, see Martin and Solovay9.

3 1750 MATHEMATICS: BAUMGARTNER ET AL. PRoc. N. A. S. If T is a partial order and p C T X Q is a finite function, then we say that p is a partial embedding if x,y C dom p and x < y implies p(x) < p(y). With any partial order T we associate the set P of partial embeddings, ordered by inclusion. If T is the order mentioned in A, then it is the partial order P to which we apply Martin's Axiom. The only difficult point is to see that the antichain condition in Martin's Axiom is satisfied. This is taken care of by Theorem 3. We first give the proof that Theorem 4 follows from Theorem 3. THEOREM 3. Let T be a tree-like partial order which contains no uncountable chains. Let P be the partial order of partial embeddings of T described above. Then every antichain contained in P is countable. THEOREM 4. Assume Martin's Axiom. Let T be any tree-like partial order in which every chain is countable, and card T < 20o. Then there is a function f: T-+Q such that x < y impliesf(x) < f(y). Proof of 4: Let P be the set of partial embeddings of T. For each x & T let D= {p C P: x & dom p}. We claim each D1 is P-dense. Suppose p & P andx Xdomp. LetX = lp(y):yedompandy<x} andlety =p(y):y E dom p and x < y}. Since p P it follows that if r1 C X and r2 C Y then r1 < r2. Since Q is densely ordered there exists r C Q such that for all ri C X, r1 < r and for all r2 C Y, r < r2. Then it is easy to see that p U { (xr)} Dz, and p U (x,r) } extends p. Hence D. is P-dense. Let M = { D.: x C T}. Clearly card M = card T < 2Po. By Theorem 3, P has no uncountable antichains, so we may apply Martin's Axiom to obtain a set G which is P-generic over M. We assert that U G is the desired embedding. It is easy to see that U G is a function since G satisfies condition (i) of the definition of generic. For each x C T we have G nf D5$ 0, so x C dom U G and hence dom U G = T. If x,y C T and x < y then there are pq G such that x C dom p and y C dom q. But then U G(x) = p(x) < q(y) = U G(y) since p and q must be compatible. This completes the proof of Theorem 4. Proof of 3: We shall prove by induction on n that * If B C P is an antichain and card p = n for all p C B, then B is countable. We assume now that * is true for m < n. We proceed by contradiction. Let B C P be an antichain with card p = n for all p C B, and suppose B is uncountable. We split the induction step of the proof into a number of steps; throughout these steps, B and n are fixed as above. Some notation will be useful. If card p = m, then p = { Po, *.., Pm-l}, where each pi is an ordered pair which we shall write as pi = (f(i), p'(i)). Thus P enumerates the domain of p, p' the range of p, and p(p(i)) = p'(i). So that P will be uniquely determined by p, we linearly order T (in any way) and require that pj enumerate dom p in increasing order. For any D C P we introduce the notation D' = { P(i): p C D}. If p C P, card p = n and i < n, we write pi = p- P = (p(j), p'(j)):j < n and j $ 4; we havep C Pandcard n-1. Notice that if x E T then { y E T: y < x} is a chain since T is tree-like, and hence must be countable. This observation will be used frequently in the rest of the proof.

4 VOL. 67, 1970 TREE-EMBEDDING IN RATIONALS 1751 Step 1: Let C C P be uncountable. Then there is some D C C, D uncountable, such that (a) for all p,q E D, p' = q' (b) if Ci is countable, then for all p,q E D, N(i) = q(i). Proof: {p': p E C} is countable, and to say that Ci is countable is to say that {p(i): p C C} is countable. Step 2: Suppose that C C B is uncountable. Then for each i < n, Ci is uncountable. Proof: Suppose Ci is countable, and i < n. Then step 1 allows us to choose D C C, D uncountable, and z C T such that for all p,q E D, p' = q' and p(i) = z. Evidently D is still an antichain. Let E = {pi: p C D}. Now we claim that if p,q C D then pi is incompatible with qi. From the claim it follows that the function p - pi is one-one, so card E = card D and E is an uncountable antichain with card pi = n - 1 for all pi E E. This contradicts the induction hypothesis. To prove the claim, first observe that if p,q are incompatible, then there are x E dom p, y C dom q so that either (i) x = y and p(x) $ q(y), (ii) x < y and p(x) > q(y) or (iii) y < x and p(x) < q(y). Now suppose that p,q C D. In case (i), if x = y $ z, thenx E dompi, y E dom q' and p2,q2 are clearly incompatible. If x = y = z, then case (i) does not arise because p'(i) = q'(i). In case (ii), if x,y $ z it is again clear that pi,qi are incompatible. If x = z, then we have (a) z < y and p(z) 2 q(y). But since p' = q' and z = p(i) = q(i), p(z) = p'(i) = q'(i) q(z), and we have (b) q(z) > q(y). Now (a) and (b) contradict q E P, so x = z cannot arise in case (ii) either. Similarly, y = z cannot arise. Case (iii) is similar to case (ii), so the claim is proved. Let U(C) denote the following condition on a subset C of B: U(C): For every i < n and every x E C2 there is a unique p C C such that x = Pf(i). Step 3: Suppose that C C B is uncountable. Then there is an uncountable D C C such that U(D) holds. Proof: By induction on i, suppose that E C C is uncountable and for all j < i, and all x E EJ, there is a unique p E E with x = p(j). By step 2, Ei is uncountable. For each x E E' we choose exactly one p CE E so that Px(i) = x, and we set D = I px: x E E'i. Then D is uncountable and satisfies the uniqueness condition for j < i. Step 4: Suppose that C C B is uncountable. Then there is an uncountable D C C such that for each i < n either Di is an uncountable antichain or D' contains no uncountable antichain. Proof: We construct a sequence C0 D C1 D.. D Ce of uncountable subsets of C as follows: Let C0 = C. Suppose we have constructed C1. If S C Cii is an uncountable antichain, then for each x C S choose P EC Ci so that pf(i) = x, and let Ci+i = Spa: x E S}. If Ci2 contains no uncountable antichains, let

5 1752 MATHEMATICS: BAUMGARTNER ET AL. PROC. N. A. S. C+, = Ca. Then C+1 is uncountable, and either (Ci+1) is an uncountable antichain or (Ci+1)1 contains no uncountable antichains. Let D = C,. It is clear that D satisfies the assertion in step 4. Step 5: Suppose R C T and R = Ro U R1 U... U Rm-, where each RJ is uncountable. Suppose further that R contains no uncountable antichains. Then there exist distinct xo, xi,..., xm-i C R such that { x>: j < m} is an antichain and for each j < m, { y C Rj: xj < y} is uncountable. Proof. We proceed by induction on m. Suppose m = 1. Let S C R be a maximal antichain. Then S is countable and every member of R is comparable with some member of S. Moreover, for each x E S the set { y C R: y < x4 is countable. Therefore, for some xo C S, { y C R: xo < y} is uncountable. Suppose m = 2. Let S' = { x E Ro: Iy E Ro: x < y} is uncountable}. Then S' is uncountable, for if not then Ro- S' is uncountable and by the case just proved for m = 1 there would exist y C Ro- S' such that { z C Ro- S': y < z4 is uncountable, and then y E S', a contradiction. Since S' is uncountable, it cannot be a chain. Hence we may choose incomparable yo,y EC S'. If { z E RIi:y < z4 is uncountable, then, letting xo = yo and xi = yi, we are done. If not, then R1' = { z e R,: z is incomparable with yi} is uncountable, and by step 5 for m = 1 there is y e R,' so that {z e R1': y < z} is uncountable. But then y and Yi are incomparable, so we let xo = Yi and xi = y. Suppose m > 2. Let R' = Ro U R1 U... U Rm-2. By inductive hypothesis there exist mutually incomparable xo', xi',..., Xm-2' e R' so that Iy e Rj: x,' < y } is uncountable for each j < m - 1. Suppose that for some j < m - 1 {y e Rm-i: x' < y } is uncountable. Then, applying step 5 for m = 2 to { y e R: X1 < yj}u{ e Rm-: x1' < y } we obtain incomparable yo,yi 2 x1' so that {y erj: yo < } y and fy e Rm-i: Yi < y } are both uncountable. Let xi = xl' for all i < m - 1, i 5 j; let xj = yo and xmi = Yi- Since T is tree-like Ix,: j < m } is an antichain. The second condition is clear. If the case above does not occur, then for all j < 1 y E Rm-: Xj' < y } is countable. Then R' = Y E Rmi-: y is incomparable with each xj' } is uncountable, and by step 5 for m = 1 there is xm-i e R' so that {y E R': xmi- < y} is uncountable. Let xj= Xj' for allj < m-1. This completes the proof. Step 6: If C C B is uncountable, then for every natural number m there is a set D C C such that card D > m and for each i < n DI is an antichain. Proof: By steps 3 and 4 we may assume that U(C) holds and that for each i < n either Ci is an uncountable antichain or else Ci contains no uncountable antichains. (By step 2, of course, each Ci is uncountable.) Let H = {i < n: CI contains no uncountable antichains }. If H is empty then it is clear that D = C works. Suppose card H = k > 0. Let ho,..., hk-i enumerate H and let m be fixed. It is now a simple matter to use step 5 repeatedly to construct simultaneously a sequence (xip: i < k, j < m) of elements of T and a sequence (Cij: i < k, j < m) of subsets of e such that the following conditions are satisfied: (1) CO1= C for each j < m (2) For each i < k, xio,...., xm-i are incomparable members of T such that for each j < m, { y C (Cij)ht: Xij < yj is uncountable, and hence {p C Cij: xj < P(hi) I is uncountable

6 VOL. 67, 1970 TREE-EMBEDDING IN RATIONALS 1753 (3) For each i with 0 < i < k, Coj = {p E Ci-i,j: xi-ltj <P(hK-i). Finally, for each j < m, choose pj E Cp. We claim D = {pj: j < m} works. Suppose ji < j2 < m and i < n. We must show that pf1(i) and pf,(i) are incomparable. If i X H then this follows from the fact that U(C) holds and CI is an antichain. If i E H then i = hi, for some io < k. But then pj#(i) 2 xtiil, Pj2#) > xioj, and xij and xioj2 are incomparable, so since T is tree-like ph2(i) and Pi2(i) are incomparable. Step 7: Suppose that C C B is uncountable and U(C) holds. Then there is no set D C C such that card D > n2 and DI is an antichain for each i < n. Proof: Suppose otherwise. Since U(C) holds (and since { y: y < x} is countable for all x E T) the set E = {p CE C: P(i) < q(j) for some ij < n and q E D} is countable. Letp C C - E and let q E D. Since q must be incompatible with p, it follows that there is a pair (ij) such that q(i) <P(j). But card D > n2, so by the familiar pigeonhole principle there exist ql,q2 C D and a pair (ij) with q, # q2 and ql(i),2(i) < PU). But then q1(i) and q2(i) are comparable since T is tree-like, and this is a contradiction. Steps 3, 6, and 7 are contradictory, and therefore * holds for n. This completes the induction and proves Theorem 4. The following problems are open: 1. Is it consistent with ZFC to assume that for any partial order P, if card P = R, and every uncountable subset of P contains an uncountable antichain, then P can be embedded in the rationals? 2. (Galvin, unpublished) Is it consistent with ZFC to assume that for any partial order P, if card P = K and if every P' C P with card P' C K can be embedded in the rationals, then P can be embedded in the rationals? 3. (Baumgartner) Is it consistent with ZFC + A = Rl to assume that every Aronszajn tree is embeddable in the rationals? This work was supported in part by NSF grants , , Baumgartner, J., Results and Independence Proofs in Combinatorial Set Theory, Ph.D. thesis, University of California, Berkeley, Baumgartner, J., "Decompositions and Embeddings of Trees," Notices Amer. Math. Soc., 17, 967 (1970). 3 Baumgartner, J., J. Malitz, and W. Reinhardt, "Embedding Trees in the Rationals," Notices Amer. Math. Soc., 17, 966 (1970). 4Kurepa, G., "Ensembles Lin6aires et une Classe de Tableaux Ramifies," Publ. Math. Univ. Belgrade, 6-7, ( ). 5 Johnston, John B., "Universal Infinite Partially Ordered Sets," Proc. Amer. Math. Soc., 7, (1956). 6 Jech, T., "Non-provability of Souslin's Hypothesis," Comment. Math. Univ. Carolinae, 8, (1967). 7Tennenbaum, S., "Souslin's Problem," Proc. Nat. Acad. Sci., USA, 59, (1968). Solovay, R. M., and S. Tennenbaum, "Iterated Cohen Extensions and Souslin's Problem," in press. 9 Martin, D. A., and R. M. Solovay, "Internal Forcing Extensions," Ann. Math. Logic, in press. 10 Cohen, P. J., Set Theory and the Continuum Hypothesis (New York, Benjamin, 1966).

Convergence and submeasures in Boolean algebras

Convergence and submeasures in Boolean algebras Convergence and submeasures in Boolean algebras Thomas Jech e-mail: jech@math.psu.edu January 30, 2018 In memory of Bohuslav Balcar Abstract A Boolean algebra carries a strictly positive exhaustive submeasure

More information

The Proper Forcing Axiom: a tutorial

The Proper Forcing Axiom: a tutorial Young Set Theory Workshop 2010, Raach, Austria. The Proper Forcing Axiom: a tutorial Justin Tatch Moore 1 Notes taken by Giorgio Venturi In these notes we will present an exposition of the Proper Forcing

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

Ultrafilters with property (s)

Ultrafilters with property (s) Ultrafilters with property (s) Arnold W. Miller 1 Abstract A set X 2 ω has property (s) (Marczewski (Szpilrajn)) iff for every perfect set P 2 ω there exists a perfect set Q P such that Q X or Q X =. Suppose

More information

Chain Conditions of Horn and Tarski

Chain 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 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

Independence of Boolean algebras and forcing

Independence of Boolean algebras and forcing Annals of Pure and Applied Logic 124 (2003) 179 191 www.elsevier.com/locate/apal Independence of Boolean algebras and forcing Milos S. Kurilic Department of Mathematics and Informatics, University of Novi

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

Lusin sequences under CH and under Martin s Axiom

Lusin sequences under CH and under Martin s Axiom F U N D A M E N T A MATHEMATICAE 169 (2001) Lusin sequences under CH and under Martin s Axiom by Uri Abraham (Beer-Sheva) and Saharon Shelah (Jerusalem) Abstract. Assuming the continuum hypothesis there

More information

M ath. Res. Lett. 15 (2008), no. 00, NN c International Press 2008 A UNIVERSAL ARONSZAJN LINE. Justin Tatch Moore. 1.

M ath. Res. Lett. 15 (2008), no. 00, NN c International Press 2008 A UNIVERSAL ARONSZAJN LINE. Justin Tatch Moore. 1. M ath. Res. Lett. 15 (2008), no. 00, 10001 100NN c International Press 2008 A UNIVERSAL ARONSZAJN LINE Justin Tatch Moore Abstract. The purpose of this note is to define an Aronszajn line η C and prove

More information

An Iterated Forcing Extension In Which All Aleph-1 Dense Sets of Reals Are Isomorphic

An Iterated Forcing Extension In Which All Aleph-1 Dense Sets of Reals Are Isomorphic San Jose State University SJSU ScholarWorks Master's Theses Master's Theses and Graduate Research Summer 2010 An Iterated Forcing Extension In Which All Aleph-1 Dense Sets of Reals Are Isomorphic Michael

More information

ITERATIONS WITH MIXED SUPPORT

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

A BOREL SOLUTION TO THE HORN-TARSKI PROBLEM. MSC 2000: 03E05, 03E20, 06A10 Keywords: Chain Conditions, Boolean Algebras.

A BOREL SOLUTION TO THE HORN-TARSKI PROBLEM. MSC 2000: 03E05, 03E20, 06A10 Keywords: Chain Conditions, Boolean Algebras. A BOREL SOLUTION TO THE HORN-TARSKI PROBLEM STEVO TODORCEVIC Abstract. We describe a Borel poset satisfying the σ-finite chain condition but failing to satisfy the σ-bounded chain condition. MSC 2000:

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

Souslin s Hypothesis

Souslin 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 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

On a Question of Maarten Maurice

On a Question of Maarten Maurice On a Question of Maarten Maurice Harold Bennett, Texas Tech University, Lubbock, TX 79409 David Lutzer, College of William and Mary, Williamsburg, VA 23187-8795 May 19, 2005 Abstract In this note we give

More information

Compact subsets of the Baire space

Compact subsets of the Baire space Compact subsets of the Baire space Arnold W. Miller Nov 2012 Results in this note were obtained in 1994 and reported on at a meeting on Real Analysis in Lodz, Poland, July 1994. Let ω ω be the Baire space,

More information

Posets, homomorphisms and homogeneity

Posets, homomorphisms and homogeneity Posets, homomorphisms and homogeneity Peter J. Cameron and D. Lockett School of Mathematical Sciences Queen Mary, University of London Mile End Road London E1 4NS, U.K. Abstract Jarik Nešetřil suggested

More information

A NOTE ON THE EIGHTFOLD WAY

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

Lusin sequences under CH and under Martin s Axiom

Lusin sequences under CH and under Martin s Axiom arxiv:math/9807178v1 [math.lo] 15 Jul 1998 Lusin sequences under CH and under Martin s Axiom Uri Abraham Department of Mathematics and Computer Science, Ben-Gurion University, Beér-Sheva, Israel Saharon

More information

Limit computable integer parts

Limit computable integer parts Limit computable integer parts Paola D Aquino, Julia Knight, and Karen Lange July 12, 2010 Abstract Let R be a real closed field. An integer part I for R is a discretely ordered subring such that for every

More information

Forcing notions in inner models

Forcing notions in inner models Forcing notions in inner models David Asperó Abstract There is a partial order P preserving stationary subsets of! 1 and forcing that every partial order in the ground model V that collapses asu ciently

More information

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

Let us first solve the midterm problem 4 before we bring up the related issues.

Let us first solve the midterm problem 4 before we bring up the related issues. Math 310 Class Notes 6: Countability Let us first solve the midterm problem 4 before we bring up the related issues. Theorem 1. Let I n := {k N : k n}. Let f : I n N be a one-toone function and let Im(f)

More information

6 CARDINALITY OF SETS

6 CARDINALITY OF SETS 6 CARDINALITY OF SETS MATH10111 - Foundations of Pure Mathematics We all have an idea of what it means to count a finite collection of objects, but we must be careful to define rigorously what it means

More information

Restricted versions of the Tukey-Teichmüller Theorem that are equivalent to the Boolean Prime Ideal Theorem

Restricted versions of the Tukey-Teichmüller Theorem that are equivalent to the Boolean Prime Ideal Theorem Restricted versions of the Tukey-Teichmüller Theorem that are equivalent to the Boolean Prime Ideal Theorem R.E. Hodel Dedicated to W.W. Comfort on the occasion of his seventieth birthday. Abstract We

More information

Weak Choice Principles and Forcing Axioms

Weak Choice Principles and Forcing Axioms Weak Choice Principles and Forcing Axioms Elizabeth Lauri 1 Introduction Faculty Mentor: David Fernandez Breton Forcing is a technique that was discovered by Cohen in the mid 20th century, and it is particularly

More information

STEVO TODORCEVIC AND JUSTIN TATCH MOORE

STEVO TODORCEVIC AND JUSTIN TATCH MOORE June 27, 2006 THE METRIZATION PROBLEM FOR FRÉCHET GROUPS STEVO TODORCEVIC AND JUSTIN TATCH MOORE 1. Introduction Let us begin this paper by recalling the following classical metrization theorem of Birkhoff

More information

TEST GROUPS FOR WHITEHEAD GROUPS

TEST GROUPS FOR WHITEHEAD GROUPS TEST GROUPS FOR WHITEHEAD GROUPS PAUL C. EKLOF, LÁSZLÓ FUCHS, AND SAHARON SHELAH Abstract. We consider the question of when the dual of a Whitehead group is a test group for Whitehead groups. This turns

More information

Mathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations

Mathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations Mathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations D. R. Wilkins Academic Year 1996-7 1 Number Systems and Matrix Algebra Integers The whole numbers 0, ±1, ±2, ±3, ±4,...

More information

Section 0.7. The Axiom of Choice, Order, and Zorn s Lemma

Section 0.7. The Axiom of Choice, Order, and Zorn s Lemma 0.7. The Axiom of Choice, Order, and Zorn s Lemma 1 Section 0.7. The Axiom of Choice, Order, and Zorn s Lemma Note. In this section, we state the Axiom of Choice and two statements equivalent to it (Zorn

More information

TOPOLOGY PROCEEDINGS Volume 28, No. 1, 2004 Pages

TOPOLOGY PROCEEDINGS Volume 28, No. 1, 2004 Pages TOPOLOGY PROCEEDINGS Volume 28, No. 1, 2004 Pages 113-132 A FAMILY OF TREES WITH NO UNCOUNTABLE BRANCHES MIRNA DŽAMONJA AND JOUKO VÄÄNÄNEN Abstract. We construct a family of 2 ℵ 1 trees of size ℵ 1 and

More information

Axioms for Set Theory

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

THE TREE PROPERTY AND THE FAILURE OF THE SINGULAR CARDINAL HYPOTHESIS AT ℵ ω 2

THE TREE PROPERTY AND THE FAILURE OF THE SINGULAR CARDINAL HYPOTHESIS AT ℵ ω 2 THE TREE PROPERTY AND THE FAILURE OF THE SINGULAR CARDINAL HYPOTHESIS AT ℵ ω 2 DIMA SINAPOVA Abstract. We show that given ω many supercompact cardinals, there is a generic extension in which the tree property

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

Chapter 2 Axiomatic Set Theory

Chapter 2 Axiomatic Set Theory Chapter 2 Axiomatic Set Theory Ernst Zermelo (1871 1953) was the first to find an axiomatization of set theory, and it was later expanded by Abraham Fraenkel (1891 1965). 2.1 Zermelo Fraenkel Set Theory

More information

DO FIVE OUT OF SIX ON EACH SET PROBLEM SET

DO FIVE OUT OF SIX ON EACH SET PROBLEM SET DO FIVE OUT OF SIX ON EACH SET PROBLEM SET 1. THE AXIOM OF FOUNDATION Early on in the book (page 6) it is indicated that throughout the formal development set is going to mean pure set, or set whose elements,

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

So in the abstract setting dene the following: f n converges to f with respect to I i every subsequence ff n : n 2 Ag has a subsequence B A such that

So in the abstract setting dene the following: f n converges to f with respect to I i every subsequence ff n : n 2 Ag has a subsequence B A such that Souslin's Hypothesis and Convergence in Category by Arnold W. Miller 1 Abstract: A sequence of functions f n : X! R from a Baire space X to the reals R is said to converge in category i every subsequence

More information

Cofinalities of Marczewski-like ideals

Cofinalities of Marczewski-like ideals Cofinalities of Marczewski-like ideals Jörg Brendle Graduate School of System Informatics Kobe University Rokko-dai 1-1, Nada-ku Kobe 657-8501, Japan email: brendle@kobe-u.ac.jp and Yurii Khomskii Hamburg

More information

An introduction to OCA

An introduction to OCA An introduction to OCA Gemma Carotenuto January 29, 2013 Introduction These notes are extracted from the lectures on forcing axioms and applications held by professor Matteo Viale at the University of

More information

FINITE BOREL MEASURES ON SPACES OF CARDINALITY LESS THAN c

FINITE BOREL MEASURES ON SPACES OF CARDINALITY LESS THAN c PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 81, Number 4, April 1981 FINITE BOREL MEASURES ON SPACES OF CARDINALITY LESS THAN c R. J. GARDNER AND G. GRUENHAGE Abstract. Let k < c be uncountable.

More information

Generic 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. 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 information

Sets, Models and Proofs. I. Moerdijk and J. van Oosten Department of Mathematics Utrecht University

Sets, Models and Proofs. I. Moerdijk and J. van Oosten Department of Mathematics Utrecht University Sets, Models and Proofs I. Moerdijk and J. van Oosten Department of Mathematics Utrecht University 2000; revised, 2006 Contents 1 Sets 1 1.1 Cardinal Numbers........................ 2 1.1.1 The Continuum

More information

MORE ABOUT SPACES WITH A SMALL DIAGONAL

MORE ABOUT SPACES WITH A SMALL DIAGONAL MORE ABOUT SPACES WITH A SMALL DIAGONAL ALAN DOW AND OLEG PAVLOV Abstract. Hušek defines a space X to have a small diagonal if each uncountable subset of X 2 disjoint from the diagonal, has an uncountable

More information

The onto mapping property of Sierpinski

The onto mapping property of Sierpinski The onto mapping property of Sierpinski A. Miller July 2014 revised May 2016 (*) There exists (φ n : ω 1 ω 1 : n < ω) such that for every I [ω 1 ] ω 1 there exists n such that φ n (I) = ω 1. This is roughly

More information

Gap Embedding for Well-Quasi-Orderings 1

Gap Embedding for Well-Quasi-Orderings 1 WoLLIC 2003 Preliminary Version Gap Embedding for Well-Quasi-Orderings 1 Nachum Dershowitz 2 and Iddo Tzameret 3 School of Computer Science, Tel-Aviv University, Tel-Aviv 69978, Israel Abstract Given a

More information

Hypersequent Calculi for some Intermediate Logics with Bounded Kripke Models

Hypersequent Calculi for some Intermediate Logics with Bounded Kripke Models Hypersequent Calculi for some Intermediate Logics with Bounded Kripke Models Agata Ciabattoni Mauro Ferrari Abstract In this paper we define cut-free hypersequent calculi for some intermediate logics semantically

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

Jónsson posets and unary Jónsson algebras

Jónsson posets and unary Jónsson algebras Jónsson posets and unary Jónsson algebras Keith A. Kearnes and Greg Oman Abstract. We show that if P is an infinite poset whose proper order ideals have cardinality strictly less than P, and κ is a cardinal

More information

THE CANTOR GAME: WINNING STRATEGIES AND DETERMINACY. by arxiv: v1 [math.ca] 29 Jan 2017 MAGNUS D. LADUE

THE CANTOR GAME: WINNING STRATEGIES AND DETERMINACY. by arxiv: v1 [math.ca] 29 Jan 2017 MAGNUS D. LADUE THE CANTOR GAME: WINNING STRATEGIES AND DETERMINACY by arxiv:170109087v1 [mathca] 9 Jan 017 MAGNUS D LADUE 0 Abstract In [1] Grossman Turett define the Cantor game In [] Matt Baker proves several results

More information

Homogeneous Structures and Ramsey Classes

Homogeneous Structures and Ramsey Classes Homogeneous Structures and Ramsey Classes Julia Böttcher April 27, 2005 In this project report we discuss the relation between Ramsey classes and homogeneous structures and give various examples for both

More information

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

The axiom of choice and two-point sets in the plane A.Miller AC and 2-point sets The axiom of choice and two-point sets in the plane Abstract Arnold W. Miller In this paper we prove that it consistent to have a two-point set in a model of ZF in which the

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

Chapter 1 : The language of mathematics.

Chapter 1 : The language of mathematics. MAT 200, Logic, Language and Proof, Fall 2015 Summary Chapter 1 : The language of mathematics. Definition. A proposition is a sentence which is either true or false. Truth table for the connective or :

More information

Club degrees of rigidity and almost Kurepa trees

Club degrees of rigidity and almost Kurepa trees Club degrees of rigidity and almost Kurepa trees Gunter Fuchs The College of Staten Island/CUNY August 25, 2012 Abstract A highly rigid Souslin tree T is constructed such that forcing with T turns T into

More information

Zermelo-Fraenkel Set Theory

Zermelo-Fraenkel Set Theory Zermelo-Fraenkel Set Theory Zak Mesyan University of Colorado Colorado Springs The Real Numbers In the 19th century attempts to prove facts about the real numbers were limited by the lack of a rigorous

More information

COUNTABLY COMPLEMENTABLE LINEAR ORDERINGS

COUNTABLY COMPLEMENTABLE LINEAR ORDERINGS COUNTABLY COMPLEMENTABLE LINEAR ORDERINGS July 4, 2006 ANTONIO MONTALBÁN Abstract. We say that a countable linear ordering L is countably complementable if there exists a linear ordering L, possibly uncountable,

More information

5 Set Operations, Functions, and Counting

5 Set Operations, Functions, and Counting 5 Set Operations, Functions, and Counting Let N denote the positive integers, N 0 := N {0} be the non-negative integers and Z = N 0 ( N) the positive and negative integers including 0, Q the rational numbers,

More information

so that u F Is p - q There exists a finite eca such that sym (g) ::> H and 1f(a) = a otherwise. We now have

so that u F Is p - q There exists a finite eca such that sym (g) ::> H and 1f(a) = a otherwise. We now have 131 Let q be the group of all permutations 1f of A such that 1f(S[i}) = S(i} for each i E: I', i.e. if 1f(a. ) = a. then i = j. Let J be the filter on q an Jm generated by [He : e e is finite }, where

More information

2.2 Lowenheim-Skolem-Tarski theorems

2.2 Lowenheim-Skolem-Tarski theorems Logic SEP: Day 1 July 15, 2013 1 Some references Syllabus: http://www.math.wisc.edu/graduate/guide-qe Previous years qualifying exams: http://www.math.wisc.edu/ miller/old/qual/index.html Miller s Moore

More information

Slow P -point Ultrafilters

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

CS156: The Calculus of Computation Zohar Manna Winter 2010

CS156: The Calculus of Computation Zohar Manna Winter 2010 Page 3 of 35 Page 4 of 35 quantifiers CS156: The Calculus of Computation Zohar Manna Winter 2010 Chapter 2: First-Order Logic (FOL) existential quantifier x. F [x] there exists an x such that F [x] Note:

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

Notes on ordinals and cardinals

Notes on ordinals and cardinals Notes on ordinals and cardinals Reed Solomon 1 Background Terminology We will use the following notation for the common number systems: N = {0, 1, 2,...} = the natural numbers Z = {..., 2, 1, 0, 1, 2,...}

More information

Increasing δ 1 2 and Namba-style forcing

Increasing δ 1 2 and Namba-style forcing Increasing δ 1 2 and Namba-style forcing Richard Ketchersid Miami University Jindřich Zapletal University of Florida April 17, 2007 Paul Larson Miami University Abstract We isolate a forcing which increases

More information

The Measure Problem. Louis de Branges Department of Mathematics Purdue University West Lafayette, IN , USA

The Measure Problem. Louis de Branges Department of Mathematics Purdue University West Lafayette, IN , USA The Measure Problem Louis de Branges Department of Mathematics Purdue University West Lafayette, IN 47907-2067, USA A problem of Banach is to determine the structure of a nonnegative (countably additive)

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

MATH FINAL EXAM REVIEW HINTS

MATH FINAL EXAM REVIEW HINTS MATH 109 - FINAL EXAM REVIEW HINTS Answer: Answer: 1. Cardinality (1) Let a < b be two real numbers and define f : (0, 1) (a, b) by f(t) = (1 t)a + tb. (a) Prove that f is a bijection. (b) Prove that any

More information

Distributivity of the algebra of regular open subsets of βr \ R

Distributivity of the algebra of regular open subsets of βr \ R Topology and its Applications 149 (2005) 1 7 www.elsevier.com/locate/topol Distributivity of the algebra of regular open subsets of βr \ R Bohuslav Balcar a,, Michael Hrušák b a Mathematical Institute

More information

that is used in this paper follows [E]. We also use the powerful method of elementary submodels which is well-presented in [JuW] chapter Topolo

that is used in this paper follows [E]. We also use the powerful method of elementary submodels which is well-presented in [JuW] chapter Topolo A LINDELÖF SPACE WITH NO LINDELÖF SUBSPACE OF SIZE @ 1 PIOTR KOSZMIDER Λ AND FRANKLIN D. TALL Λ Abstract: A consistent example of an uncountable Lindelöf T 3 (and hence normal) space with no Lindelöf subspace

More information

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

SET MAPPING REFLECTION

SET 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 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

Section 7.5: Cardinality

Section 7.5: Cardinality Section 7: Cardinality In this section, we shall consider extend some of the ideas we have developed to infinite sets One interesting consequence of this discussion is that we shall see there are as many

More information

SEPARATION AXIOMS FOR INTERVAL TOPOLOGIES

SEPARATION AXIOMS FOR INTERVAL TOPOLOGIES PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 79, Number 2, June 1980 SEPARATION AXIOMS FOR INTERVAL TOPOLOGIES MARCEL ERNE Abstract. In Theorem 1 of this note, results of Kogan [2], Kolibiar

More information

A strongly rigid binary relation

A strongly rigid binary relation A strongly rigid binary relation Anne Fearnley 8 November 1994 Abstract A binary relation ρ on a set U is strongly rigid if every universal algebra on U such that ρ is a subuniverse of its square is trivial.

More information

Banach-Mazur game played in partially ordered sets

Banach-Mazur game played in partially ordered sets Banach-Mazur game played in partially ordered sets arxiv:1505.01094v1 [math.lo] 5 May 2015 Wies law Kubiś Department of Mathematics Jan Kochanowski University in Kielce, Poland and Institute of Mathematics,

More information

Disjoint paths in tournaments

Disjoint paths in tournaments Disjoint paths in tournaments Maria Chudnovsky 1 Columbia University, New York, NY 10027, USA Alex Scott Mathematical Institute, University of Oxford, 24-29 St Giles, Oxford OX1 3LB, UK Paul Seymour 2

More information

2. Prime and Maximal Ideals

2. Prime and Maximal Ideals 18 Andreas Gathmann 2. Prime and Maximal Ideals There are two special kinds of ideals that are of particular importance, both algebraically and geometrically: the so-called prime and maximal ideals. Let

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

Selective Ultrafilters on FIN

Selective Ultrafilters on FIN Selective Ultrafilters on FIN Yuan Yuan Zheng Abstract We consider selective ultrafilters on the collection FIN of all finite nonempty subsets of N. If countablesupport side-by-side Sacks forcing is applied,

More information

Disjointness conditions in free products of. distributive lattices: An application of Ramsay's theorem. Harry Lakser< 1)

Disjointness conditions in free products of. distributive lattices: An application of Ramsay's theorem. Harry Lakser< 1) Proc. Univ. of Houston Lattice Theory Conf..Houston 1973 Disjointness conditions in free products of distributive lattices: An application of Ramsay's theorem. Harry Lakser< 1) 1. Introduction. Let L be

More information

Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra

Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra D. R. Wilkins Contents 3 Topics in Commutative Algebra 2 3.1 Rings and Fields......................... 2 3.2 Ideals...............................

More information

Annals of Pure and Applied Logic

Annals of Pure and Applied Logic Annals of Pure and Applied Logic 161 (2010) 916 922 Contents lists available at ScienceDirect Annals of Pure and Applied Logic journal homepage: www.elsevier.com/locate/apal Cardinal characteristics and

More information

On universal graphs without cliques or without large bipartite graphs

On universal graphs without cliques or without large bipartite graphs Carnegie Mellon University Research Showcase @ CMU Department of Mathematical Sciences Mellon College of Science 1995 On universal graphs without cliques or without large bipartite graphs Menachem Kojman

More information

Silver trees and Cohen reals

Silver trees and Cohen reals Silver trees and Cohen reals Otmar Spinas Abstract We prove that the meager ideal M is Tukey reducible to the Mycielski ideal J(Si) which is the ideal associated with Silver forcing Si. This implies add

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

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

THE STRONG TREE PROPERTY AND THE FAILURE OF SCH

THE STRONG TREE PROPERTY AND THE FAILURE OF SCH THE STRONG TREE PROPERTY AND THE FAILURE OF SCH JIN DU Abstract. Fontanella [2] showed that if κ n : n < ω is an increasing sequence of supercompacts and ν = sup n κ n, then the strong tree property holds

More information

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

Gleason s Theorem for non-separable Hilbert spaces: Extended abstract Gleason s Theorem for non-separable Hilbert spaces: Extended abstract R. M. Solovay May 2, 2009 1 Introduction: Statement of Results The probelm of generalizing Gleason s theorem to the non separable case

More information

Every Lusin set is undetermined in the point-open game

Every Lusin set is undetermined in the point-open game F U N D A M E N T A MATHEMATICAE 144 (1994) Every Lusin set is undetermined in the point-open game by Ireneusz Recław (Gdańsk) Abstract. We show that some classes of small sets are topological versions

More information

Definability in the Enumeration Degrees

Definability in the Enumeration Degrees Definability in the Enumeration Degrees Theodore A. Slaman W. Hugh Woodin Abstract We prove that every countable relation on the enumeration degrees, E, is uniformly definable from parameters in E. Consequently,

More information

= ϕ r cos θ. 0 cos ξ sin ξ and sin ξ cos ξ. sin ξ 0 cos ξ

= ϕ r cos θ. 0 cos ξ sin ξ and sin ξ cos ξ. sin ξ 0 cos ξ 8. The Banach-Tarski paradox May, 2012 The Banach-Tarski paradox is that a unit ball in Euclidean -space can be decomposed into finitely many parts which can then be reassembled to form two unit balls

More information

Functions and cardinality (solutions) sections A and F TA: Clive Newstead 6 th May 2014

Functions and cardinality (solutions) sections A and F TA: Clive Newstead 6 th May 2014 Functions and cardinality (solutions) 21-127 sections A and F TA: Clive Newstead 6 th May 2014 What follows is a somewhat hastily written collection of solutions for my review sheet. I have omitted some

More information

The following techniques for methods of proofs are discussed in our text: - Vacuous proof - Trivial proof

The following techniques for methods of proofs are discussed in our text: - Vacuous proof - Trivial proof Ch. 1.6 Introduction to Proofs The following techniques for methods of proofs are discussed in our text - Vacuous proof - Trivial proof - Direct proof - Indirect proof (our book calls this by contraposition)

More information

A GUIDE FOR MORTALS TO TAME CONGRUENCE THEORY

A GUIDE FOR MORTALS TO TAME CONGRUENCE THEORY A GUIDE FOR MORTALS TO TAME CONGRUENCE THEORY Tame congruence theory is not an easy subject and it takes a considerable amount of effort to understand it. When I started this project, I believed that this

More information

On the open-open game

On the open-open game F U N D A M E N T A MATHEMATICAE 145 (1994) On the open-open game by Peg D a n i e l s (Auburn, Ala.), Kenneth K u n e n (Madison, Wisc.) and Haoxuan Z h o u (San Antonio, Tex.) Abstract. We modify a game

More information

On Recognizable Languages of Infinite Pictures

On Recognizable Languages of Infinite Pictures On Recognizable Languages of Infinite Pictures Equipe de Logique Mathématique CNRS and Université Paris 7 LIF, Marseille, Avril 2009 Pictures Pictures are two-dimensional words. Let Σ be a finite alphabet

More information