Archives
Keywords
reflection principles Interval topology on trees OCA Non-saturation Local Club Condensation. Selective Ultrafilter Square-Brackets Partition Relations unbounded function Hereditarily Lindelöf space Microscopic Approach full tree Ascending path regressive Souslin tree Reduced Power Dushnik-Miller square principles Singular cardinals combinatorics C-sequence Amenable C-sequence Hedetniemi's conjecture Forcing with side conditions Generalized Clubs Large Cardinals Uniformization Fast club Well-behaved magma Open Access Absoluteness Diamond Precaliber Erdos Cardinal Prikry-type forcing Fodor-type reflection indecomposable filter Sierpinski's onto mapping principle Hindman's Theorem Closed coloring super-Souslin tree Ineffable cardinal Cardinal Invariants b-scale Commutative projection system Forcing very good scale HOD sap middle diamond Constructible Universe square SNR Club Guessing Strongly compact cardinal Dowker space Ulam matrix Singular cofinality Weakly compact cardinal Kurepa Hypothesis Greatly Mahlo projective Boolean algebra PFA perfectly normal Strong coloring free Boolean algebra Entangled linear order Commutative cancellative semigroups P-Ideal Dichotomy Ostaszewski square Poset Subtle tree property Subtle cardinal Subnormal ideal Strongly Luzin set Filter reflection Parameterized proxy principle Axiom R Uniformly homogeneous Generalized descriptive set theory Mandelbrot set Almost countably chromatic Forcing Axioms countably metacompact positive partition relation tensor product graph incompactness Analytic sets transformations Martin's Axiom Antichain Lipschitz reduction 54G20 Knaster specializable Souslin tree Partition Relations Reflecting stationary set Intersection model Chromatic number AIM forcing Rado's conjecture Nonspecial tree stationary reflection Sigma-Prikry Ascent Path Erdos-Hajnal graphs Whitehead Problem L-space Distributive tree Monotonically far Chang's conjecture Cohen real Almost-disjoint family Uniformly coherent Shelah's Strong Hypothesis GMA Countryman line weak diamond Rainbow sets nonmeager set ZFC construction Universal Sequences Fat stationary set strongly bounded groups Diamond-sharp polarized partition relation Almost Souslin Jonsson cardinal coloring number Successor of Regular Cardinal Successor of Singular Cardinal S-Space Rock n' Roll Slim tree Iterated forcing Vanishing levels free Souslin tree higher Baire space Postprocessing function Souslin Tree club_AD weak square ccc Sakurai's Bell inequality Knaster and friends O-space Subadditive Small forcing Ramsey theory over partitions Partition relations for trees Coherent tree Cardinal function xbox Aronszajn tree stationary hitting Diamond for trees Respecting tree weak Kurepa tree diamond star Foundations Minimal Walks Prevalent singular cardinals Singular Density Luzin set stick PFA(S)[S] Was Ulam right? approachability ideal
Category Archives: Blog
Pure logic
While traveling downtown today, I came across a sign near a local church, with a quotation of Saint-Exupéry:
Jane’s Addiction visiting Toronto
Last night, I went to see a live show by Jane’s Addiction, in downtown Toronto. Here’s a video snippet from that show which I could found on YouTube: The playlist was excellent, but there was one song which I was … Continue reading
c.c.c. vs. the Knaster property
After my previous post on Mekler’s characterization of c.c.c. notions of forcing, Sam, Mike and myself discussed the value of it . We noticed that a prevalent verification of the c.c.c. goes like this: given an uncountable set of conditions, … Continue reading
Dushnik-Miller for regular cardinals (part 3)
Here is what we already know about the Dushnik-Miller theorem in the case of $\omega_1$ (given our earlier posts on the subject): $\omega_1\rightarrow(\omega_1,\omega+1)^2$ holds in ZFC; $\omega_1\rightarrow(\omega_1,\omega+2)^2$ may consistently fail; $\omega_1\rightarrow(\omega_1,\omega_1)^2$ fails in ZFC. In this post, we shall provide … Continue reading
A large cardinal in the constructible universe
In this post, we shall provide a proof of Silver’s theorem that the Erdos caridnal $\kappa(\omega)$ relativizes to Godel’s constructible universe. First, recall some definitions. Given a function $f:[\kappa]^{<\omega}\rightarrow \mu$, we say that $I\subseteq\kappa$ is a set of indiscernibles for … Continue reading
An inconsistent form of club guessing
In this post, we shall present an answer (due to P. Larson) to a question by A. Primavesi concerning a certain strong form of club guessing. We commence with recalling Shelah’s concept of club guessing. Concept (Shelah). Given a regular … 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
Dushnik-Miller for regular cardinals (part 2)
In this post, we shall provide a proof of Todorcevic’s theorem, that $\mathfrak b=\omega_1$ implies $\omega_1\not\rightarrow(\omega_1,\omega+2)^2$. This will show that the Erdos-Rado theorem that we discussed in an earlier post, is consistently optimal. Our exposition of Todorcevic’s theorem would be … Continue reading
Dushnik-Miller for singular cardinals (part 1)
Continuing the previous post, let us now prove the following. Theorem (Erdos-Dushnik-Miller, 1941). For every singular cardinal λ, we have: $$\lambda\rightarrow(\lambda,\omega)^2.$$ Proof. Suppose that $\lambda$ is a singular cardinal, and $c:[\lambda]^2\rightarrow\{0,1\}$ is a given coloring. For any ordinal $\alpha<\lambda$, denote … Continue reading
