Roman Pol

dblp:310/7592 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2026
0000-0003-0668-8005ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2 · 1 first-author · 2 since 2021
YearPublicationVenuePosition
2026 On Sierpiński sets, Hurewicz spaces and Hilgers functions
Witold Marciszewski, Roman Pol, Piotr Zakrzewski
Ann. Pure Appl. Log.2
2021 Countably Perfectly meager Sets
abstract
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.
Roman Pol, Piotr Zakrzewski
J. Symb. Log.1