6 citations · 16 across the 19 of their papers we have counts for
5 papers · 1 filter
Maximum deconstructibility in module categories
Sean Cox
We prove that Vopěnka's Principle implies that for every class of modules over any ring, the class of \textbf{-Gorenstein Projective modul…
Forcing axioms and the complexity of non-stationary ideals
Sean Cox, Philipp Lücke
We study the influence of strong forcing axioms on the complexity of the non-stationary ideal on and its restrictions to certain cofinalities. Our main result shows that the…
Filtration Games and Potentially Projective Modules
Sean D. Cox
The notion of a \textbf{-filtered} object, where is some (typically small) collection of objects in a Grothendieck category, has become ubiq…
Compactness versus hugeness at successor cardinals
Sean Cox, Monroe Eskew
If is regular and , then the existence of a weakly presaturated ideal on implies . This partially answers a question of Foreman and Magidor ab…
The Löwenheim-Skolem-Tarski property of Stationary Logic
Sean Cox
Fuchino-Maschio-Sakai~\cite{FuchinoEtAl_DRP_LST} proved that the Löwenheim-Skolem-Tarski (LST) property of Stationary Logic is equivalent to the Diagonal Reflection Principle on in…