By W. Weiss

**Read Online or Download An Introduction to Set Theory PDF**

**Similar pure mathematics books**

**Theory of Function Spaces III (Monographs in Mathematics) (v. 3)**

This booklet bargains with the hot idea of functionality areas because it stands now. designated awareness is paid to a couple advancements within the final 10–15 years that are heavily on the topic of the these days a variety of purposes of the speculation of functionality areas to a few neighbouring parts akin to numerics, sign processing and fractal research.

**Finite Mathematics for the Managerial, Life, and Social Sciences, 8th Edition **

Within the market-leading FINITE arithmetic FOR THE MANAGERIAL, lifestyles, AND SOCIAL SCIENCES, Soo T. Tan presents a correct, available presentation of finite arithmetic mixed with simply the precise stability of purposes, pedagogy, and expertise to aid scholars achieve the path. the hot 8th variation contains hugely attention-grabbing present functions and Microsoft Excel routines to aid stimulate pupil motivation.

**Extra info for An Introduction to Set Theory**

**Sample text**

But we will take the liberty of calling our constructs “the natural numbers”. We begin by taking 0 as the empty set ∅. We write 1 2 3 succ(x) for for for for {0} {0, 1} {0, 1, 2} x ∪ {x} We write “n is a natural number” for [n = ∅ ∨ (∃l ∈ n)(n = succ(l))] ∧ (∀m ∈ n)[m = ∅ ∨ (∃l ∈ n)(m = succ(l))] and write: N for {n : n is a natural number} The reader can gain some familiarity with these definitions by checking that succ(n) ∈ N for all n ∈ N. 31 32 CHAPTER 4. THE NATURAL NUMBERS We now begin to develop the basic properties of the natural numbers by introducing an important concept.

THE NATURAL NUMBERS Chapter 5 The Ordinal Numbers The natural number system can be extended to the system of ordinal numbers. An ordinal is a transitive set of transitive sets. More formally: for any term t, “t is an ordinal” is an abbreviation for (t is transitive) ∧ (∀x ∈ t)(x is transitive). We often use lower case Greek letters to denote ordinals. We denote {α : α is an ordinal} by ON. From Theorem 6 we see immediately that N ⊆ ON. Theorem 10. 1. ON is transitive. 2. ¬(∃z)(z = ON). Proof. 1.

Every set has a cardinality. Those ordinals which are |x| for some x are called cardinals. Exercise 19. Prove that each n ∈ ω is a cardinal and that ω is a cardinal. Show that ω + 1 is not a cardinal and that, in fact, each other cardinal is a limit ordinal. Theorem 23. The following are equivalent. 1. κ is a cardinal. 2. , |κ| = κ. 3. (∀α < κ)(¬∃ injection f : κ → α). 59 60 CHAPTER 7. CARDINALITY Proof. We prove the negations of each are equivalent: ¬(1) (∀x)[(∃ bijection g : x → κ) → (∃α < κ)(∃ bijection h : x → α)] ¬(2) ∃α < κ ∃ bijection f : κ → α ¬(3) ∃α < κ ∃ injection f : κ → α ¬(2) ⇒ ¬(1) Just take h = f ◦ g.