PreprintPDF Available
Preprints and early-stage research may not have been peer reviewed yet.

Abstract

Lecture notes of the Introductory course in the Classical Set Theory, based on axioms of von Neumann-Bernays-Godel.
A preview of the PDF is not available
ResearchGate has not been able to resolve any citations for this publication.
Article
A cardinal number m will be called measurable if and only if there is a set X of cardinality m and a non-trivial, real-valued, countably additive measure μ defined on all subsets of X. (The term non-trivial can be taken to mean that μ(X) = 1 and μ({x}) = 0, for all χ ɛ X). If 2ℵ0 = ℵ1, Banach and Kuratowski [1] proved that ℵ1 is not measurable. Ulam [12] proved that if there is a measurable cardinal, then either 2ℵ0 is measurable or there exists a 2-valued measurable cardinal (2-valued in the sense that the measure μ can be assumed to take on only the values 0 and 1). Ulam and Tarski showed that no cardinal less than the first strengly inaccessible cardinal beyond ℵ0 can be 2-valued measurable (cf. [12], esp. footnote 1, p. 146). Last year, using some new results of Hanf, Tarski proved [11] that many inaccessibles, in particular the first beyend ℵ0, are not 2-valued measurable (for other proofs cf. [6] and [2]). Even though the least 2-valued measurable cardinal, if it exists at all, now appears to be incredibly large since Tarski's results apply to a seemingly inexhaustible number of inaccessible cardinals, it still seems plausible to many people including the author to assume that such cardinals do exist. However, this assumption has some surprising consequences, for, as shall be outlined below, we can show that the existence of measurable cardinals contradiets Gödel's axiom of constructibility…
Book
1 About the course, and these notes.- Part I: Motivation and Examples.- 2 Making Some Things Precise.- 3 Free Groups.- 4 A Cook's Tour.- Part II: Basic Tools and Concepts.- 5 Ordered Sets, Induction, and the Axiom of Choice.- 6 Lattices, Closure Operators, and Galois Connections.- 7 Categories and Functors.- 8 Universal Constructions.- 9 Varieties of Algebras.- Part III: More on Adjunctions.- 10 Algebras, Coalgebras, and Adjunctions.- References.- List of Exercises.- Symbol Index.- Word and Phrase Index.
z we can apply Proposition 18.8 and the preceding statement to conclude that TC( x, y, z ) = {{ x, y }, { x, y , z}} ∪ TC( x, y ) ∪ TC(z) ⊆ {{{{x}, {x, y}}}, {{{x}, {x, y}}
  • Since
Since x, y, z = x, y, z we can apply Proposition 18.8 and the preceding statement to conclude that TC( x, y, z ) = {{ x, y }, { x, y, z}} ∪ TC( x, y ) ∪ TC(z) ⊆ {{{{x}, {x, y}}}, {{{x}, {x, y}}, z}} ∪ G({x, y}) ∪ TC(x ∪ y) ∪ TC(z) ⊆