activity
20042022
most citedForcing with quotients

2 citations · 5 across the 6 of their papers we have counts for

collaborators
Showing math.LOShow all

6 papers · 1 filter

math.LO2021

HL ideals and Sacks indestructible ultrafilters

David Chodounský, Osvaldo Guzmán, Michael Hrušák

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 prov…

math.LO20212 cited

Simutaneously vanishing higher derived limits without large cardinals

Jeffrey Bergfalk, Michael Hrušák, Chris Lambie-Hanson

A question dating to Sibe Mardešić and Andrei Prasolov's 1988 work Strong homology is not additive, and motivating a considerable amount of set theoretic work in the ensuing years,…

math.LO2020

Tukey order among ideals

Jialiang He, Michael Hrušák, Diego Rojas-Rebolledo +1

We investigate the Tukey order in the class of ideals of subsets of . We show that no nontrivial ideal is Tukey below a ideal of compact sets. We introduce the…

math.LO2018

Ramsey theory for highly connected monochromatic subgraphs

Jeffrey Bergfalk, Michael Hrušák, Saharon Shelah

An infinite graph is highly connected if the complement of any subgraph of smaller size is connected. We consider weaker versions of Ramsey's Theorem asserting that in any coloring…

math.LO2012

Base Tree Property

Bohuslav Balcar, Michal Doucha, Michael Hrušák

Building on previous work of [BPS] we investigate -closed partial orders of size continuum. We provide both an internal and external characterization of such partial orders by s…

math.LO20042 cited

Forcing with quotients

Michael Hrusak, Jindrich Zapletal

We study an extensive connection between factor forcings of Borel subsets of Polish spaces modulo a sigma-ideal, and factor forcings of subsets of countable sets modulo an ideal.