A proof of Shelah's partition theorem
✍ Scribed by Menachem Kojman
- Book ID
- 120105744
- Publisher
- Springer
- Year
- 1995
- Tongue
- English
- Weight
- 103 KB
- Volume
- 34
- Category
- Article
- ISSN
- 0933-5846
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A proof of the Halpern-Läuchli partition theorem and its version for strong subtrees is given. We prove a general statement which has, as an immediate consequence, the above-mentioned results. The proof of this is direct and avoids metamathematical arguments. Some consequences for partitions of fini
## Abstract Shelah has shown (see [1]) that the number __d__, the smallest cardinality of a dominating family, is less than or equal to the number __i__, the smallest cardinality of a maximal independent family on ω. This was done using a downward Löwenheim‐Skolem argument. Thus it is interesting t