David Chodounský

dblp:167/7611 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
2since 2021 · last 2024
0000-0002-3352-9213ORCID · corroborated

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

Theory of computation · 4 · 4 first-author · 2 since 2021
YearPublicationVenuePosition
2024 HL ideals and Sacks indestructible ultrafilters
abstract
We study ultrafilters on countable sets and reaping families which are indestructible by Sacks forcing. We deal with the combinatorial characterization of such families and we prove that every reaping family of size smaller than the continuum is Sacks indestructible. We prove that complements of many definable ideals are Sacks reaping indestructible, with one notable exception, the complement of the ideal Z of sets of asymptotic density zero. We investigate the existence of Sacks indestructible ultrafilters and prove that every Sacks indestructible ultrafilter is a Z-ultrafilter.
David Chodounský, Osvaldo Guzmán, Michael Hrusák
Ann. Pure Appl. Log.1
2021 Indestructibility of ideals and MAD families
David Chodounský, Osvaldo Guzmán González
Ann. Pure Appl. Log.1
2015 Why Y-c.c
David Chodounský, Jindrich Zapletal
Ann. Pure Appl. Log.1
2015 Mathias forcing and Combinatorial Covering Properties of filters
abstract
Abstract We give topological characterizations of filters ${\cal F}$ onωsuch that the Mathias forcing ${M_{\cal F}}$ adds no dominating reals or preserves ground model unbounded families. This allows us to answer some questions of Brendle, Guzmán, Hrušák, Martínez, Minami, and Tsaban.
David Chodounský, Dusan Repovs, Lyubomyr Zdomskyy
J. Symb. Log.1