A direct proof of a result of Shelah

Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 38 (1):325-326 (1992)
  Copy   BIBTEX

Abstract

Shelah has shown 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 to find a direct “elementary” proof. Here we show that this can be done

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,551

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

A more direct proof of a result of Shelah.Winfried Just - 1991 - Annals of Pure and Applied Logic 53 (3):261-267.
Ideals of independence.Vera Fischer & Diana Carolina Montoya - 2019 - Archive for Mathematical Logic 58 (5-6):767-785.
A game‐theoretic proof of Shelah's theorem on labeled trees.Trevor M. Wilson - 2020 - Mathematical Logic Quarterly 66 (2):190-194.

Analytics

Added to PP
2013-12-01

Downloads
49 (#449,543)

6 months
6 (#869,904)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references