Countably perfectly Meager sets

Journal of Symbolic Logic 86 (3):1214-1227 (2021)
  Copy   BIBTEX

Abstract

We study a strengthening of the notion of a perfectly meager set. We say that a subset A of a perfect Polish space X is countably perfectly meager in X, if for every sequence of perfect subsets $\{P_n: n \in \mathbb N\}$ of X, there exists an $F_\sigma $ -set F in X such that $A \subseteq F$ and $F\cap P_n$ is meager in $P_n$ for each n. We give various characterizations and examples of countably perfectly meager sets. We prove that not every universally meager set is countably perfectly meager correcting an earlier result of Bartoszyński.

Other Versions

No versions found

Links

PhilArchive

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

Meager-Additive Sets in Topological Groups.Ondřej Zindulka - 2022 - Journal of Symbolic Logic 87 (3):1046-1064.
A model with no magic set.Krzysztof Ciesielski & Saharon Shelah - 1999 - Journal of Symbolic Logic 64 (4):1467-1490.
Strongly Meager Sets Do Not Form an Ideal.Tomek Bartoszynski & Saharon Shelah - 2001 - Journal of Mathematical Logic 1 (1):1-34.
Turing independence and Baire category.Ashutosh Kumar & Saharon Shelah - 2025 - Journal of Mathematical Logic 25 (1).
U-lusin sets in hyperfinite time lines.Renling Jin - 1992 - Journal of Symbolic Logic 57 (2):528-533.
Analytic countably splitting families.Otmar Spinas - 2004 - Journal of Symbolic Logic 69 (1):101-117.

Analytics

Added to PP
2021-12-06

Downloads
45 (#1,274,879)

6 months
16 (#749,564)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Meager-Additive Sets in Topological Groups.Ondřej Zindulka - 2022 - Journal of Symbolic Logic 87 (3):1046-1064.
Every Sierpiński set is strongly meager.Janusz Pawlikowski - 1996 - Archive for Mathematical Logic 35 (5-6):281-285.

Add more references