Archives
Keywords
Subadditive square principles super-Souslin tree Monotonically far Commutative cancellative semigroups PFA Greatly Mahlo b-scale stationary hitting Hedetniemi's conjecture PFA(S)[S] Weakly compact cardinal Parameterized proxy principle Generalized Clubs projective Boolean algebra Subtle cardinal Ascending path Partition relations for trees Knaster Cardinal Invariants tensor product graph strongly bounded groups Prikry-type forcing Minimal Walks Non-saturation weak Kurepa tree Shelah's Strong Hypothesis Singular Density Commutative projection system Uniformly homogeneous square Singular cofinality Analytic sets specializable Souslin tree nonmeager set Well-behaved magma club_AD Erdos-Hajnal graphs Partition Relations Knaster and friends regressive Souslin tree Small forcing ZFC construction Uniformization Successor of Regular Cardinal Generalized descriptive set theory Coherent tree Strongly Luzin set Jonsson cardinal Uniformly coherent Fat stationary set L-space P-Ideal Dichotomy Hindman's Theorem Strong coloring Intersection model Forcing Closed coloring middle diamond Ineffable cardinal O-space Slim tree Strongly compact cardinal Lipschitz reduction Hereditarily Lindelöf space OCA weak square weak diamond Reflecting stationary set Souslin Tree Chromatic number Kurepa Hypothesis perfectly normal Club Guessing diamond star polarized partition relation Rock n' Roll Was Ulam right? Constructible Universe free Boolean algebra Postprocessing function Diamond-sharp Subnormal ideal Subtle tree property Iterated forcing Prevalent singular cardinals Amenable C-sequence higher Baire space xbox Sierpinski's onto mapping principle Respecting tree sap Interval topology on trees Distributive tree Ulam matrix Nonspecial tree Microscopic Approach Singular cardinals combinatorics Almost Souslin Martin's Axiom Universal Sequences transformations positive partition relation very good scale Vanishing levels Forcing with side conditions indecomposable filter unbounded function Foundations Cohen real Filter reflection incompactness AIM forcing reflection principles Sakurai's Bell inequality full tree Countryman line Almost-disjoint family Ascent Path coloring number Almost countably chromatic Dowker space Diamond Ostaszewski square Selective Ultrafilter Diamond for trees 54G20 S-Space Sigma-Prikry C-sequence Axiom R Local Club Condensation. Rado's conjecture Aronszajn tree Large Cardinals Erdos Cardinal Whitehead Problem SNR Reduced Power stationary reflection approachability ideal HOD countably metacompact ccc Rainbow sets free Souslin tree Ramsey theory over partitions Precaliber Fodor-type reflection Entangled linear order Absoluteness Successor of Singular Cardinal Forcing Axioms Square-Brackets Partition Relations GMA Mandelbrot set Open Access Luzin set Fast club Poset stick Antichain Chang's conjecture Dushnik-Miller Cardinal function
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 $\kappa$-Souslin tree with full vanishing levels. This answers a question from a previous paper, and provides an … Continue reading
Posted in Compactness, Publications
Tagged Ascent Path, C-sequence, Intersection model, Souslin Tree, Subtle tree property, Vanishing levels
2 Comments
Ketonen’s question and other cardinal sins
Joint work with Zhixing You and Jiachen Yuan. Abstract. Answering a question of Ketonen from the late 1970’s, it is proved that a weakly compact cardinal carrying an indecomposable ultrafilter need not be measurable. The result is obtained by analyzing … Continue reading
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
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 $\aleph_\omega$ together with the reflection of all stationary subsets of $\aleph_{\omega+1}$. This shows that two classical results of … Continue reading
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 $\Sigma$-Prikry, and showed that many of the known Prikry-type notions of forcing that centers … Continue reading
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 $\Sigma$-Prikry, and show that many of the known Prikry-type notions of forcing that centers around singular cardinals of countable cofinality … Continue reading
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
