COUNTABLY PERFECTLY MEAGER SETS
The Journal of Symbolic Logic · 2021-09 · 86 (3) · 1214-1227
DOI: 10.1017/jsl.2021.35 ↗Kurz gefasst
Fachartikel in der Zeitschrift The Journal of Symbolic Logic, online erschienen am 07.06.2021. Verfasst von ROMAN POL und 1 weiteren Autor:innen. Die Arbeit wurde bisher 4-mal zitiert (Crossref) und nennt 26 Literaturangaben.
Abstract (Originalsprache)
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.
Zitieren
APA
POL, R., & ZAKRZEWSKI, P. (2021). COUNTABLY PERFECTLY MEAGER SETS. The Journal of Symbolic Logic, 86(3), 1214-1227. https://doi.org/10.1017/jsl.2021.35
Vancouver
POL R, ZAKRZEWSKI P. COUNTABLY PERFECTLY MEAGER SETS. The Journal of Symbolic Logic. 2021;86(3):1214-1227. doi:10.1017/jsl.2021.35
BibTeX
@article{POL2021,
author = {POL, ROMAN and ZAKRZEWSKI, PIOTR},
title = {COUNTABLY PERFECTLY MEAGER SETS},
journal = {The Journal of Symbolic Logic},
year = {2021},
volume = {86},
number = {3},
pages = {1214--1227},
doi = {10.1017/jsl.2021.35}
}
EUVIMED