Archives
Keywords
Fat stationary set OCA Analytic sets incompactness Ulam matrix Filter reflection regressive Souslin tree Uniformly homogeneous higher Baire space Martin's Axiom PFA(S)[S] Knaster and friends reflection principles Prikry-type forcing club_AD positive partition relation transformations Universal Sequences Ineffable cardinal weak diamond Axiom R weak square Cohen real strongly bounded groups Iterated forcing Constructible Universe Shelah's Strong Hypothesis Countryman line Aronszajn tree Uniformly coherent Subtle tree property Strong coloring Rock n' Roll ccc free Boolean algebra Foundations Almost Souslin Erdos Cardinal unbounded function weak Kurepa tree Ascent Path Kurepa Hypothesis Weakly compact cardinal Singular cardinals combinatorics Local Club Condensation. Rainbow sets Commutative cancellative semigroups S-Space Diamond Singular Density HOD Sigma-Prikry Singular cofinality P-Ideal Dichotomy Subnormal ideal Erdos-Hajnal graphs Reflecting stationary set Open Access Non-saturation GMA Cardinal Invariants Vanishing levels Sakurai's Bell inequality Generalized descriptive set theory Amenable C-sequence Fodor-type reflection stick Hereditarily Lindelöf space Forcing Axioms Poset xbox Strongly compact cardinal Uniformization Greatly Mahlo tensor product graph SNR Chromatic number b-scale Respecting tree Cardinal function Minimal Walks nonmeager set Selective Ultrafilter Strongly Luzin set C-sequence sap Almost-disjoint family Ostaszewski square Antichain Chang's conjecture Hedetniemi's conjecture Parameterized proxy principle approachability ideal Generalized Clubs Square-Brackets Partition Relations stationary reflection indecomposable ultrafilter Whitehead Problem Souslin Tree Precaliber very good scale Forcing PFA Knaster Distributive tree Mandelbrot set Subadditive Well-behaved magma Microscopic Approach Fast club L-space Dushnik-Miller Subtle cardinal Intersection model countably metacompact Lipschitz reduction Diamond for trees Nonspecial tree polarized partition relation free Souslin tree Small forcing Large Cardinals Luzin set full tree Sierpinski's onto mapping principle Ramsey theory over partitions middle diamond Partition Relations AIM forcing Reduced Power Coherent tree square Club Guessing 54G20 Successor of Singular Cardinal Jonsson cardinal Commutative projection system diamond star Successor of Regular Cardinal specializable Souslin tree Slim tree stationary hitting Was Ulam right? Absoluteness Diamond-sharp square principles coloring number super-Souslin tree O-space Rado's conjecture ZFC construction Dowker space Prevalent singular cardinals Postprocessing function projective Boolean algebra Almost countably chromatic Hindman's Theorem Closed coloring
Category Archives: Compactness
A new model for all C-sequences are trivial
Joint work with Zhixing You and Jiachen Yuan. Abstract. We construct a model in which all C-sequences are trivial, yet there exists a
Posted in Compactness, Preprints
Tagged Ascent Path, C-sequence, Intersection model, Souslin Tree, Vanishing levels
Comments Off on A new model for all C-sequences are trivial
Ketonen’s question and other cardinal sins
Joint work with Zhixing You and Jiachen Yuan. Abstract. Intersection models of generic extensions obtained from a commutative projection systems of notions of forcing has recently regained interest, especially in the study of descriptive set theory. Here, we show that … Continue reading
Posted in Compactness, Preprints
Tagged 03E05, 03E35, 03E55, Ascent Path, C-sequence, Commutative projection system, indecomposable ultrafilter, Intersection model, Strongly compact cardinal
Comments Off on Ketonen’s question and other cardinal sins
Squares, ultrafilters and forcing axioms
Joint work with Chris Lambie-Hanson and Jing Zhang. Abstract. We study the interplay of the three families of combinatorial objects or principles. Specifically, we show the following. Strong forcing axioms, in general incompatible with the existence of indexed squares, can … Continue reading
Posted in Compactness, Preprints
Tagged Forcing Axioms, indecomposable ultrafilter, Subadditive, unbounded function
Comments Off on Squares, ultrafilters and forcing axioms
Sigma-Prikry forcing III: Down to Aleph_omega
Joint work with Alejandro Poveda and Dima Sinapova. Abstract. We prove the consistency of the failure of the singular cardinals hypothesis at
Sigma-Prikry forcing II: Iteration Scheme
Joint work with Alejandro Poveda and Dima Sinapova. Abstract. In Part I of this series, we introduced a class of notions of forcing which we call
Knaster and friends II: The C-sequence number
Joint work with Chris Lambie-Hanson. Abstract. Motivated by a characterization of weakly compact cardinals due to Todorcevic, we introduce a new cardinal characteristic, the C-sequence number, which can be seen as a measure of the compactness of a regular uncountable … Continue reading
Sigma-Prikry forcing I: The Axioms
Joint work with Alejandro Poveda and Dima Sinapova. Abstract. We introduce a class of notions of forcing which we call
The eightfold way
Joint work with James Cummings, Sy-David Friedman, Menachem Magidor, and Dima Sinapova. Abstract. Three central combinatorial properties in set theory are the tree property, the approachability property and stationary reflection. We prove the mutual independence of these properties by showing … Continue reading
Reflection on the coloring and chromatic numbers
Joint work with Chris Lambie-Hanson. Abstract. We prove that reflection of the coloring number of graphs is consistent with non-reflection of the chromatic number. Moreover, it is proved that incompactness for the chromatic number of graphs (with arbitrarily large gaps) … Continue reading
Posted in Compactness, Infinite Graphs, Publications
Tagged 03E35, 05C15, 05C63, Chang's conjecture, Chromatic number, coloring number, Fodor-type reflection, incompactness, Iterated forcing, Parameterized proxy principle, Postprocessing function, Rado's conjecture, square, stationary reflection
2 Comments
