Paolo Leonetti

dblp:241/9700 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2026
0000-0001-7819-5301ORCID · corroborated

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

Theory of computation · 2 · 2 since 2021
YearPublicationVenuePosition
2026 Topological complexity of ideal limit points
abstract
Given an ideal I on the nonnegative integers ω and a Polish space X , let L ( I ) be the family of subsets S ⊆ X such that S is the set of I -limit points of some sequence taking values in X . First, we show that L ( I ) may attain arbitrarily large complexity among the finite levels of the Borel hierarchy. Second, we prove that if I is a G δ σ -ideal then all elements of L ( I ) are closed. Third, we show that if I is a simply coanalytic ideal and X is first countable, then every element of L ( I ) is simply analytic. Lastly, we study certain structural properties and the topological complexity of minimal ideals I for which L ( I ) contains a given set.
Marek Balcerzak, Szymon Glab, Paolo Leonetti
Ann. Pure Appl. Log.3
2022 Density-like and generalized density ideals
abstract
Abstract We show that there exist uncountably many (tall and nontall) pairwise nonisomorphic density-like ideals on $\omega $ which are not generalized density ideals. In addition, they are nonpathological. This answers a question posed by Borodulin-Nadzieja et al. in [this Journal, vol. 80 (2015), pp. 1268–1289]. Lastly, we provide sufficient conditions for a density-like ideal to be necessarily a generalized density ideal.
Adam Kwela, Paolo Leonetti
J. Symb. Log.2