Thomas Jech. Set Theory. Academic Press, 1978.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....4.18 (Mans eld, Solovay) The following are equivalent: i) every uncountable 1 set contains a perfect subset; ii) for all x N, L(x) 1 is countable; iii) 1 is an inaccessible cardinal in L. In particular if V = L, then there is 1 set with no perfect subset. For proofs see [5] x41. Baire Property We will show that analytic sets have the Baire Property. We begin by giving another normal form for 1 sets. Let X be a Polish space. De nition 4.19 Suppose B X for all 2 N . We de ne A(fB g) f2N B : We call A the Souslin operation. Exercise ....

....several examples of higher level projective sets. Example 4.29 Let MV = ff 2 C(I) f satis es the mean value theoremg. Then MV is 2 . f 2 MV if and only if 8x8y x y 9z f is di erentiable at z and f (z) f(x) f(y) x y Two interesting example arise when studying L. See [5] x41. Example 4.30 The set fx 2 N : x 2 Lg is 2 . The idea of the proof is that there is a sentence such that ZF and L is absolute for transitive models of . Using the Mostowski collapse x 2 L if and only if there is M a countable well founded model of V = L with x 2 M. This is a ....

[Article contains additional citation context not shown here]

T. Jech, Set Theory, Academic Press, New York, 1978.

....the axioms of ZFC. For the remainder of the chapter, I want to assume a little more. In particular, I will use ZFC there exists an inaccessible cardinal, # as my background set theory throughout sections 2.1 and 2.2. Basic information about inaccessible cardinals can be found in [26] and [30] or in sections 1.1 and 4.3.1 of this dissertation. 2.1 Transitivity In section 1.1, I introduced the notion of a transitive model for the language of set theory. In this section, I look in more detail at the role these models play (or can play) in the formulation of Skolem s Paradox. I ....

....here. The relevant facts about N # are these: 1. N # is a countable, transitive model of ZFC, 2. N # is an end extension of N (i.e. for any n n ) and 3. N # # 1 is countable . Further details about this type of construction can be found in chapter 7 of [30] or chapter 3 of [26]. For the purposes of this thesis, only the three above listed facts about N # will actually be used. The first of these equivalences follows simply from the fact that N # is transitive. The second follows from the fact that What s more, there s no possibility of explaining this divergence by ....

[Article contains additional citation context not shown here]

Thomas Jech. Set Theory. Academic Press, San Diego, 1978.

....x X A R satisfies the correspondent for completeness for the conjunction of the Friedman axioms ) The part in quotes is 0 since all second order quantffiers range over X. Further more the formula X = D is E, hen the entire statement is E. From the Levy Shoenfield Absoluteness Lea (cf. Jech [1978], p. 120) it follows that (C) holds in the constructible universe L. We now show that this is a contradiction. Observe first that by using our truth definition in L, we may add a generalized quantffier Q to the lanage G, where G, have the standard interpretation; Q will satisfy the ....

T. JECH, Set theory, Academic Press.

....in effective computability: Gdel s result on the undecidability of arithmetic and Church s result on the undecidability of first order logic. In composing this chapter up to Frege, von Wright s treatises on analytical philosophy [127, 129] have been greatly useful. Jech s book on set theory [66] helped in tracing the history of the ZF theory, and a term paper by Dirk Schlimm [106] was helpful in tracing the development of primitive recursion. We assume that the reader is familiar with the basic notions of modern logic. The variant of modern formal notation used is discussed at length in ....

.... the Zermelo Fraenkel axiomatization of set theory was formulated by John von Neumann [87] Von Neumann s axiomatization talked about functions, not sets, so the axiom is not very understandable in its orgininal form (axiom IV 2 of [87] Therefore, we give a modern formulation (after Jech [66] but using our notation) Axiom IX (Axiom of regularity) 8 S : S 6= 9 x 2 S : S x = Here denotes the class of all sets. 30 3.7 The dream torn asunder An important part of the program of the logicians of twentieth century was to find the perfect axiomatization that will dictate the ....

[Article contains additional citation context not shown here]

Thomas Jech. Set Theory. New York: Academic Press, 1978.

....We ll say more about the history of the problem later on. Now when we say that we want to avoid using the axiom of choice, it is not merely, or even mainly, because we think the axiom is probably not true . 1 The real reason for avoiding the axiom of choice is that it is not definite. See Jech [4]. To prove that 3 Theta A i 3 Theta B means somehow or other to show that from a one to one correspondence between 3 Theta A and 3 Theta B, you can produce a one to one correspondence between A and B. If the proof requires the axiom of choice, then the procedure will involve at some point or ....

T. Jech. Set Theory. Academic Press, New York, 1978.

....5.1 Let D is a set of sentences and K = Cn(D) If D have a NWOP E D = D,PD, then there exists a NWOP E c = K, 7 c, c) and vice versa, such that for any A D, b (A) b(A) 12) We will call E c the NWOP of K induced by E z Proof: Let. be the order type of pz under well ordering z (see [15]) For any 3 . we denote p as the 3th element of pz and p z = J p. For any 3 a, we define p by recursion on 3 as follows: Cn (p0 p Cn(p Z)p , if 3 a Let P = P l 3 a . It is obvious that K = J p and P is a partition of K. Definite that 10 To show (12) let A 6 D and bZ (A) 3. ....

T. Jech, Set Theory, (Academic Press, New York, 1978).

....that if player B wins this new game, sometimes in the first game B could not have possibly played optimally . It is well known that AC (the axiom of choice) and AD are contradictory. The usual proof uses a diagonal argument combined with the fact that the number of strategies is 2 0 [1] [2]. The status of AD has been examined in great depth [4] 5] There seems to be two approaches. One can accept AC and ask which sets are determined. This leads to questions which are independent of the usual axiomatization of set theory [2] 4] 5] The other and more radical approach is to ....

....with the fact that the number of strategies is 2 0 [1] 2] The status of AD has been examined in great depth [4] 5] There seems to be two approaches. One can accept AC and ask which sets are determined. This leads to questions which are independent of the usual axiomatization of set theory [2], 4] 5] The other and more radical approach is to discard the axiom of choice [3] The main argument is that AD is deductively strong and has many nice consequences, 2] 4] Still there is no doubt that most of us prefer AC. Let Q denote the rational numbers. Theorem (AC) There exists a set ....

[Article contains additional citation context not shown here]

T.Jech ; Set theory, Academic press London (1978)

....proper and firmly rooted understanding of the symmetries. This is also the reason for the unproportional size of Section 2 compared to the other sections. 2. DEFINITIONS AND NOTATIONS 2.0. Set theoretic notation. Most of our set theoretic notation is standard and can be found in textbooks like [Je78] Ku83] or [BaJu95] For the definitions and some basic facts concerning the projective hierarchy we refer the reader to [Kan94, x12] We shall consider the set [ as the set of real numbers. For the Turing join of two reals x and y (i.e. coding two reals into one) we use the standard ....

....We define : n r by stipulating (s) Gamma Min(s ) n f0g Delta . It is easy to see that if (X) n is constant for an X 2 F, then [Min(X) n f0g] n is constant, too. q.e.d. Proposition 3.2. It is consistent with ZFC that there are no scp ultrafilters. Proof. Kunen proved (cf. Je78, Theorem 91] that it is consistent with ZFC that there are no Ramsey filters on . Therefore, by Fact 3.1, in a model of ZFC in which there are no Ramsey filters, there are also no scp ultrafilters. q.e.d. Let U F = h( i be the partial order defined as in Subsection 2.3. It is easy to ....

[Article contains additional citation context not shown here]

Thomas Jech: "Set Theory." Academic Press, San Diego (1978).

....hP; iisseparativeifforeveryp;q 2 P such thatp 6. q thereexistsr 2 P withr6. q andp 6. r. Fact4.5.IfhP; i isseparative,there existsa uniquecompleteboolean algebra B containingP suchthat (1)The orderofB extendsthatofP ; 2)P isdenseinB . Fortheproof,seeLemma 17.2inThomas Jech sbook [Je]. NoticethatsincetheW (p;A )isingeneralnotclosedunderconjunctions, thepartiallyorderedsetW (p;A )isnotseparative.However,thefollowing fact(Lemma 17.3of[Je] allows ustocircumventthisdi culty. Fact4.6.LethP; P ibeanarbitrarypartiallyordered set.Thenthereexist a uniqueseparativepartiallyordered ....

....algebra B containingP suchthat (1)The orderofB extendsthatofP ; 2)P isdenseinB . Fortheproof,seeLemma 17.2inThomas Jech sbook [Je] NoticethatsincetheW (p;A )isingeneralnotclosedunderconjunctions, thepartiallyorderedsetW (p;A )isnotseparative.However,thefollowing fact(Lemma 17.3of[Je])allows ustocircumventthisdi culty. Fact4.6.LethP; P ibeanarbitrarypartiallyordered set.Thenthereexist a uniqueseparativepartiallyordered sethQ; Q ianda functionh :P Q suchthat (1)h[P ]isdenseinQ ; A PRIMER OF SIMPLE THEORIES 29 (2)Ifp . P q,thenh(p) Q h(q) 3)p andqarecompatibleinP ....

[Article contains additional citation context not shown here]

Thomas Jech.Set Theory.AcademicPress,New York,1978.

.... Souslin Trees on by Menachem Kojman and Saharon Shelahy The Hebrew University, Jerusalem ABSTRACT We prove that = 2 = and there is a non reflecting stationary subset of composed of ordinals of cofinality imply that there is a complete Souslin tree on . Introduction The old problem of the existence of Souslin trees has attracted the attention of ....

....We prove that = 2 = and there is a non reflecting stationary subset of composed of ordinals of cofinality imply that there is a complete Souslin tree on . Introduction The old problem of the existence of Souslin trees has attracted the attention of many (see [Je] for history) While the 1 case is settled, the consistency of GCH SH( 2 ) is still an open question. Gregory showed in [G] that GCH there is a non reflecting stationary set of cofinal elements of 2 implies the existence of an 2 Souslin tree. Gregory s result showed that the ....

[Article contains additional citation context not shown here]

T. Jech, Set Theory, Academic press, 1978.

..... So fl is countable in M [G] M [G 1 ] G] In other words, Q collapses fl to be countable. Our conclusion easily follows from this. For let H be a Q name for a generic for r: o: P) If b 2 r: o: P) let (b) be the boolean value in r: o: Q) that b 2 H . As in the proof of Lemma 25.5 from [Jech], it is easy to see that is a complete embedding. It follows that there is a G 2 such that G 2 is M [G 1 ] generic over Q, with H 2 M [G 1 ] G 2 ] Fix such a G 2 . By exercise (D4) on page 244 of [Kunen] G 2 is M generic over Q 0 2 and M [G 2 ] M [G 1 ] G 2 ] It follows that G 2 is ....

Thomas Jech, Set theory, Academic Press, Inc., San Diego, California, 1978.

....S 2On F = L. Proof. holds since the de nition of the ne hierarchy can be carried out absolutely inside the inner model L. For ( set F1 = S 2On F . It suces to show that F1 is an inner model of set theory since L is the smallest inner model. By a variant of Theorem 31 of [3] it is enough to check the following three facts: 1) F1 is transitive; this holds by 2.3. c) 5 (2) F1 is closed with respect to rst order de nability, i.e. for all 2 formulas (v 0 ; v m 1 ) and a 1 ; am 1 ; z 2 F1 we have fa 0 2 z j (z; 2) j= a 0 ; am 1 ]g 2 F1 ....

Jech, Thomas, Set Theory, Academic Press, 1978

....to the function taking each F in [Z X ] to F (1) The V coded in the ultrapower model will be the domain of our model. By constructing the nonprincipal ultra lters U i with more care, we proceed 13 to prove the main theorem. This construction will use the Erd os Rado partition theorem (See [12], p. 323) It is an immediate consequence of the Erd os Rado theorem that any map from [i ] n to is constant on [Y ] n for some in nite subset Y of i . The construction proceeds as follows. Construct an ultrapower model (of the standard variety) of V (the subscript here is chosen ....

....ultrapower to an inner model M of ZFC . The usual elementary embedding of a set or class into its ultrapowers 26 via equivalence classes of constant functions yields an elementary embedding j of the universe V into the inner model M . The measurable is sent by j to a larger ordinal j( See [12], after p. 305, for details. We de ne a nonstandard model of the full theory of V , where = lim j i ( The elements are all those functions s with domain a tail [n; 1) of N (or all of N ) with the property that s(n) 2 j n (V ) and s(n 1) j(s(n) whenever s(n) is de ned, and that ....

Jech, T. Set Theory . Academic Press, New York, 1978.

....There is a wealth of set theoretical axiom systems which extend the usual axioms and which are (presumably) consistent and realizable in first order structures. This is well documented RECEIVED : November 19th, 1999; REVISED : May 8th, 2001 247 248 PETER KOEPKE in the standard textbooks [Je78] and [Ka94] which we recommend as a general reference for this article. Most research in axiomatic set theory consists in constructing and examining transitive models of the axioms of ZFC. Since the consistency results of axiomatic set theory are relative consistencies, new models of set theory ....

....from parameters. Note that the family of classes which are n definable from parameters can be described by a single n 1 formula. Inner models can be characterized as classes which are transitive, closed with respect to the finite set of G ODEL functions and almost universal (see [Je78, Chapter 2] An embedding : M N is 1 elementary iff it is fully elementary (see [Ka94, p.45] This indicates that the category of inner models can be uniformly represented within the system ZFC by a concrete but complicated formula which we shall not state explicitely. The constant n ....

Thomas Jech, Set Theory, San Diego 1978

....K and therefore n M for all n . Lemma 2.1 Suppose V = K, and ; M are as in the previous discussion. Then in K there is a long unfoldable min I. Proof: Each 2 I is ine able (similar to the argument that Silver indiscernibles are ine able in L; cf. for example [5] p.395) By Villaveces argument there are which are unfoldable in V . Fix such a . Using the equivalent formulation of unfoldable in terms of elementary extensions, we see that for any S there are chains of transitive ZFC models M 2 V , and subsets S with hV ; 2; Si hM ; ....

T. Jech, Set Theory Academic Press. 1978.

....nite support iteration. A proof of this theorem is given here for completness. For general facts on Boolean algebras, see Koppelberg [Ko] The notion of well generated Boolean algebras is presented and dealt with in [BR1] and 5 [BR2] General facts in set theory and forcing can be found in Jech [Je]. For an example of the use of Knaster property in forcing, see Kunen and Tall [KT] 2 Tail systems For a set of ordinals u let u lim denote the set of all ordinals sup(u) which are accumulation points of u. So lim 1 denotes the set of countable limit ordinals. For sets a; b let a n ....

Jech T. J., Set Theory, Academic Press, New York 1978.

....sets of # lacks the property of Baire and yet is obtained from open sets by this Souslin operation. We thank Jouko Vaananen for reading this paper and suggesting many improvements, and Taneli Huuskonen for helping the first author to prepare the paper. Our set theoretical notation is standard, see [3]. Ordinals are denoted by #, #, #, #, i, j; cardinals by #, and sequences by #, # . Length of a sequence # is denoted by lg(#) We denote [#, #) i # # i # . If # and # are sequences, then # C # means that # is an initial segment of # . For a cardinal # and a set A we denote [A] # ....

T. Jech. Set Theory , Academic Press, New York--San Francisco--London, 1978.

No context found.

Thomas Jech. Set Theory. Academic Press, 1978.

No context found.

T. Jech. Set Theory. Academic Press, 1978.

No context found.

T. Jech. Set Theory. Academic Press, 1978.

No context found.

T. Jech, Set theory, Academic Press, 1978.

No context found.

Jech, T.: 1977, Set theory, Springer, 2nd. ed.

No context found.

T. Jech, Set theory, Academic Press, 1978.

No context found.

T. Jech, Set theory, Academic Press, New York (1978).

No context found.

Thomas Jech.Set Theory.AcademicPress,New York,1978.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC