Archives
Keywords
Was Ulam right? Forcing with side conditions Cardinal function O-space Ascending path Club Guessing Open Access Small forcing Uniformly homogeneous Filter reflection polarized partition relation Absoluteness P-Ideal Dichotomy Entangled linear order Almost Souslin Singular cardinals combinatorics positive partition relation projective Boolean algebra stick Cohen real Shelah's Strong Hypothesis Coherent tree countably metacompact S-Space Rado's conjecture full tree GMA xbox free Boolean algebra Respecting tree Amenable C-sequence Erdos Cardinal Forcing Dushnik-Miller Successor of Regular Cardinal Fat stationary set Weakly compact cardinal Aronszajn tree Mandelbrot set Square-Brackets Partition Relations Lipschitz reduction Subtle cardinal Large Cardinals square principles Poset Forcing Axioms super-Souslin tree Nonspecial tree Universal Sequences Knaster and friends weak square unbounded function Commutative projection system Ulam matrix Slim tree Fast club AIM forcing Almost countably chromatic Hereditarily Lindelöf space Generalized Clubs reflection principles club_AD Fodor-type reflection square Postprocessing function Ramsey theory over partitions Uniformization Rock n' Roll Foundations Axiom R b-scale Sakurai's Bell inequality free Souslin tree Uniformly coherent Hindman's Theorem approachability ideal Minimal Walks middle diamond Well-behaved magma very good scale perfectly normal Non-saturation Distributive tree Chang's conjecture diamond star Cardinal Invariants SNR Singular Density Reduced Power Sierpinski's onto mapping principle Microscopic Approach Chromatic number Almost-disjoint family Ostaszewski square Subtle tree property Greatly Mahlo Subnormal ideal Parameterized proxy principle Partition Relations Subadditive weak diamond Strongly compact cardinal transformations HOD Intersection model PFA Jonsson cardinal specializable Souslin tree Partition relations for trees PFA(S)[S] Diamond-sharp Martin's Axiom Ineffable cardinal Prikry-type forcing coloring number stationary hitting Successor of Singular Cardinal Closed coloring Strongly Luzin set Singular cofinality Iterated forcing indecomposable filter Souslin Tree Diamond Strong coloring regressive Souslin tree ccc L-space Hedetniemi's conjecture tensor product graph sap C-sequence Whitehead Problem nonmeager set Dowker space Vanishing levels Precaliber Knaster weak Kurepa tree Generalized descriptive set theory ZFC construction Commutative cancellative semigroups Kurepa Hypothesis Reflecting stationary set Analytic sets Antichain Interval topology on trees higher Baire space Constructible Universe stationary reflection Ascent Path Rainbow sets Monotonically far Diamond for trees Prevalent singular cardinals incompactness Sigma-Prikry OCA 54G20 strongly bounded groups Erdos-Hajnal graphs Countryman line Selective Ultrafilter Luzin set Local Club Condensation.
Tag Archives: stationary reflection
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
The 15th International Workshop on Set Theory in Luminy, September 2019
I gave an invited talk at the 15th International Workshop on Set Theory in Luminy in Marseille, September 2019. Talk Title: Chain conditions, unbounded colorings and the C-sequence spectrum. Abstract: The productivity of the $\kappa$-chain condition, where $\kappa$ is a regular, … Continue reading
Posted in Invited Talks
Tagged Closed coloring, Knaster, Precaliber, stationary reflection, unbounded function
Comments Off on The 15th International Workshop on Set Theory in Luminy, September 2019
Knaster and friends I: Closed colorings and precalibers
Joint work with Chris Lambie-Hanson. Abstract. The productivity of the $\kappa$-chain condition, where $\kappa$ is a regular, uncountable cardinal, has been the focus of a great deal of set-theoretic research. In the 1970s, consistent examples of $\kappa$-cc posets whose squares … Continue reading
A remark on Schimmerling’s question
Joint work with Ari Meir Brodsky. Abstract. Schimmerling asked whether $\square^*_\lambda$ together with GCH entails the existence of a $\lambda^+$-Souslin tree, for a singular cardinal $\lambda$. Here, we provide an affirmative answer under the additional assumption that there exists a … Continue reading
Weak square and stationary reflection
Joint work with Gunter Fuchs. Abstract. It is well-known that the square principle $\square_\lambda$ entails the existence of a non-reflecting stationary subset of $\lambda^+$, whereas the weak square principle $\square^*_\lambda$ does not. Here we show that if $\mu^{cf(\lambda)}<\lambda$ for all $\mu<\lambda$, … Continue reading
Posted in Publications, Squares and Diamonds
Tagged 03E05, 03E35, 03E57, Diamond, Forcing Axioms, stationary reflection, weak square
Leave a comment
MFO workshop in Set Theory, February 2017
I gave an invited talk at the Set Theory workshop in Obwerwolfach, February 2017. Talk Title: Coloring vs. Chromatic. Abstract: In a joint work with Chris Lambie-Hanson, we study the interaction between compactness for the chromatic number (of graphs) and … Continue reading
Posted in Invited Talks
Tagged Chromatic number, coloring number, incompactness, stationary reflection
Leave a comment
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
The reflection principle $R_2$
A few years ago, in this paper, I introduced the following reflection principle: Definition. $R_2(\theta,\kappa)$ asserts that for every function $f:E^\theta_{<\kappa}\rightarrow\kappa$, there exists some $j<\kappa$ for which the following set is nonstationary: $$A_j:=\{\delta\in E^\theta_\kappa\mid f^{-1}[j]\cap\delta\text{ is nonstationary}\}.$$ I wrote there … Continue reading
Posted in Blog
Tagged reflection principles, square, stationary reflection, Weakly compact cardinal
Comments Off on The reflection principle $R_2$
Young Researchers in Set Theory, March 2011
These are the slides of a talk I gave at the Young Researchers in Set Theory 2011 meeting (Königswinter, 21–25 March 2011). Talk Title: Around Jensen’s square principle Abstract: Jensen‘s square principle for a cardinal $\lambda$ asserts the existence of a particular ladder … Continue reading
