Archives
Keywords
PFA(S)[S] Large Cardinals Hedetniemi's conjecture b-scale HOD Generalized Clubs Commutative cancellative semigroups Uniformly homogeneous Fast club Aronszajn tree 54G20 Absoluteness square principles PFA Filter reflection Rainbow sets Dushnik-Miller Parameterized proxy principle Small forcing Prikry-type forcing Rado's conjecture Cohen real AIM forcing Hereditarily Lindelöf space Knaster Reflecting stationary set Hindman's Theorem indecomposable ultrafilter Sierpinski's onto mapping principle Rock n' Roll Ostaszewski square Erdos Cardinal Lipschitz reduction Open Access Slim tree GMA Ineffable cardinal square Foundations Knaster and friends Sakurai's Bell inequality positive partition relation P-Ideal Dichotomy Analytic sets Strong coloring Was Ulam right free Boolean algebra nonmeager set S-Space Luzin set Antichain Prevalent singular cardinals Vanishing levels Coherent tree Minimal Walks ccc Cardinal Invariants weak diamond Weakly compact cardinal Erdos-Hajnal graphs Distributive tree countably metacompact Diamond free Souslin tree Uniformization Uniformly coherent Successor of Singular Cardinal Closed coloring regressive Souslin tree Shelah's Strong Hypothesis Chromatic number Fodor-type reflection Iterated forcing Poset specializable Souslin tree Microscopic Approach stationary reflection stick Almost Souslin Universal Sequences Subtle cardinal Subnormal ideal Almost-disjoint family Club Guessing Well-behaved magma coloring number Axiom R Chang's conjecture xbox O-space Diamond-sharp Ascent Path very good scale Almost countably chromatic Successor of Regular Cardinal Mandelbrot set diamond star Nonspecial tree Whitehead Problem Forcing strongly bounded groups Fat stationary set Forcing Axioms Ulam matrix Subtle tree property OCA middle diamond Singular cardinals combinatorics Local Club Condensation. ZFC construction Dowker space Generalized descriptive set theory tensor product graph SNR Jonsson cardinal Selective Ultrafilter polarized partition relation stationary hitting Postprocessing function Kurepa Hypothesis Reduced Power unbounded function Amenable C-sequence Square-Brackets Partition Relations reflection principles full tree higher Baire space sap Precaliber Cardinal function weak square Greatly Mahlo Strongly Luzin set club_AD Subadditive transformations incompactness super-Souslin tree Sigma-Prikry Diamond for trees Singular cofinality Partition Relations C-sequence Ramsey theory over partitions Souslin Tree projective Boolean algebra L-space Constructible Universe Non-saturation Martin's Axiom approachability ideal Singular Density
Blog Archives
Diamond on Kurepa trees
Joint work with Ziemek Kostana and Saharon Shelah. Abstract. We introduce a new weak variation of diamond that is meant to only guess the branches of a Kurepa tree. We demonstrate that this variation is considerably weaker than diamond by … Continue reading
Posted in Preprints, Squares and Diamonds
Tagged Diamond, Diamond for trees, Iterated forcing, Kurepa Hypothesis
Comments Off on Diamond on Kurepa trees
Generalizations of Martin’s Axiom and the well-met condition
Recall that Martin’s Axiom asserts that for every partial order $\mathbb P$ satisfying c.c.c., and for any family $\mathcal D$ of $<2^{\aleph_0}$ many dense subsets of $\mathbb P$, there exists a directed subset $G$ of $\mathbb P$ such that $G\cap … Continue reading
Square principles
Since the birth of Jensen’s original Square principle, many variations of the principle were introduced and intensively studied. Asaf Karagila suggested me today to put some order into all of these principles. Here is a trial. Definition. A square principle … Continue reading
Partitioning the club guessing
In a recent paper, I am making use of the following fact. Theorem (Shelah, 1997). Suppose that $\kappa$ is an accessible cardinal (i.e., there exists a cardinal $\theta<\kappa$ such that $2^\theta\ge\kappa)$. Then there exists a sequence $\langle g_\delta:C_\delta\rightarrow\omega\mid \delta\in E^{\kappa^+}_\kappa\rangle$ … Continue reading
Shelah’s approachability ideal (part 2)
In a previous post, we defined Shelah’s approachability ideal $I[\lambda]$. We remind the reader that a subset $S\subseteq\lambda$ is in $I[\lambda]$ iff there exists a collection $\{ \mathcal D_\alpha\mid\alpha<\lambda\}\subseteq\mathcal [\mathcal P(\lambda)]^{<\lambda}$ such that for club many $\delta\in S$, the union … Continue reading
Posted in Blog, Expository, Open Problems
Tagged approachability ideal, Club Guessing
Leave a comment
The chromatic numbers of the Erdos-Hajnal graphs
Recall that a coloring $c:G\rightarrow\kappa$ of an (undirected) graph $(G,E)$ is said to be chromatic if $c(v_1)\neq c(v_2)$ whenever $\{v_1,v_2\}\in E$. Then, the chromatic number of a graph $(G,E)$ is the least cardinal $\kappa$ for which there exists a chromatic … Continue reading
Posted in Blog, Expository
Tagged Chromatic number, Erdos-Hajnal graphs, Rado's conjecture, reflection principles
13 Comments
Shelah’s approachability ideal (part 1)
Given an infinite cardinal $\lambda$, Shelah defines an ideal $I[\lambda]$ as follows. Definition (Shelah, implicit in here). A set $S$ is in $I[\lambda]$ iff $S\subseteq\lambda$ and there exists a collection $\{ \mathcal D_\alpha\mid\alpha<\lambda\}\subseteq\mathcal [\mathcal P(\lambda)]^{<\lambda}$, and some club $E\subseteq\lambda$, so … Continue reading
Comparing rectangles with squares through rainbow sets
In Todorcevic’s class last week, he proved all the results of Chapter 8 from his Walks on Ordinals book, up to (and including) Theorem 8.1.11. The upshots are as follows: Every regular infinite cardinal $\theta$ admits a naturally defined function … Continue reading
c.c.c. forcing without combinatorics
In this post, we shall discuss a short paper by Alan Mekler from 1984, concerning a non-combinatorial verification of the c.c.c. property for forcing notions. Recall that a notion of forcing $\mathbb P$ is said to satisfy the c.c.c. iff … Continue reading
Dushnik-Miller for singular cardinals (part 2)
In the first post on this subject, we provided a proof of $\lambda\rightarrow(\lambda,\omega+1)^2$ for every regular uncountable cardinal $\lambda$. In the second post, we provided a proof of $\lambda\rightarrow(\lambda,\omega)^2$ for every singular cardinal $\lambda$, and showed that $\lambda\rightarrow(\lambda,\omega+1)^2$ fails for every … Continue reading
Posted in Blog, Expository
Tagged Dushnik-Miller, Partition Relations, Singular cardinals combinatorics
27 Comments