U-Meager sets when the cofinality and the coinitiality of U are uncountable

Journal of Symbolic Logic 56 (3):906-914 (1991)
  Copy   BIBTEX

Abstract

We prove that every countably determined set C is U-meager if and only if every internal subset A of C is U-meager, provided that the cofinality and coinitiality of the cut U are both uncountable. As a consequence we prove that for such cuts a countably determined set C which intersects every U-monad in at most countably many points is U-meager. That complements a similar result in [KL]. We also give some partial solutions to some open problems from [KL]. We prove that the set K = {1,...,H}, where H is an infinite integer, cannot be expressed as a countable union of countably determined sets each of which is U-meager for some cut U with min{cf (U), ci (U)} ≥ ω1. Also, every Borel, Σ1 m or countably determined set C which is U-meager for every cut U is a countable union of Borel, Σ1 m or countably determined sets respectively, which are U-nowhere dense for every cut U. Further, the class of Borel U-meager sets for min{cf(U), ci(U)} ≥ ω1 coincides with the least family of sets containing internal U-meager sets and closed with respect to the operation of countable union and intersection. The same is true if the phrase "U-meager sets" is replaced by "U-meager for every cut U."

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,221

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

U-monad topologies of hyperfinite time lines.Renling Jin - 1992 - Journal of Symbolic Logic 57 (2):534-539.
U-lusin sets in hyperfinite time lines.Renling Jin - 1992 - Journal of Symbolic Logic 57 (2):528-533.
Cuts in hyperfinite time lines.Renling Jin - 1992 - Journal of Symbolic Logic 57 (2):522-527.
Nonstandard natural number systems and nonstandard models.Shizuo Kamo - 1981 - Journal of Symbolic Logic 46 (2):365-376.
Stationary reflection for uncountable cofinality.Péter Komjáth - 1986 - Journal of Symbolic Logic 51 (1):147-151.

Analytics

Added to PP
2009-01-28

Downloads
21 (#628,100)

6 months
2 (#658,980)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references