𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A short proof of the preservation of the ωω-bounding property

✍ Scribed by Chaz Schlindwein

Publisher
John Wiley and Sons
Year
2004
Tongue
English
Weight
86 KB
Volume
50
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

There are two versions of the Proper Iteration Lemma. The stronger (but less well‐known) version can be used to give simpler proofs of iteration theorems (e.g., [7, Lemma 24] versus [9, Theorem IX.4.7]). In this paper we give another demonstration of the fecundity of the stronger version by giving a short proof of Shelah's theorem on the preservation of the ω^ω^‐bounding property. (© 2003 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)

📜 SIMILAR VOLUMES

A short proof of a partition theorem for
A short proof of a partition theorem for the ordinal ωω
✍ Jean A. Larson 📂 Article 📅 1973 🏛 Elsevier Science ⚖ 716 KB

An ordinal a is equal to the set of its predecessors and is ordered by the membership relation. For any ordinal a, one writes a -~ (a, m) 2 if and only if for any set A order-isomorphic to a, and any function f from the pairs of elements of A into {0, 1}, either there is a subset X c\_ A order-isomo

A short proof of the degree bound for in
A short proof of the degree bound for interval number
✍ Douglas B. West 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 141 KB

A short proof is given of the fact that every graph has an interval representation of depth 2 in which each vertex u is represented by at most &f(u) + 11 intervals, except for an arbitrarily specified vertex w that appears left-most in the representation and is represented by at most [&d(w) + 1)1 in