Archives
Keywords
Parameterized proxy principle specializable Souslin tree tensor product graph Closed coloring Coherent tree b-scale Forcing Axioms Ostaszewski square regressive Souslin tree full tree Almost Souslin C-sequence weak diamond Sigma-Prikry xbox Poset OCA Club Guessing Shelah's Strong Hypothesis middle diamond Axiom R Singular cofinality Postprocessing function GMA Singular cardinals combinatorics Generalized descriptive set theory indecomposable ultrafilter Slim tree Rado's conjecture Diamond Dowker space Erdos Cardinal Uniformization sap Absoluteness polarized partition relation S-Space diamond star Antichain Strong coloring Strongly Luzin set Lipschitz reduction Greatly Mahlo stationary hitting reflection principles Dushnik-Miller Uniformly homogeneous Ineffable cardinal Successor of Singular Cardinal Forcing higher Baire space Diamond for trees Selective Ultrafilter unbounded function Sierpinski's onto mapping principle Small forcing Filter reflection Large Cardinals Ramsey theory over partitions Martin's Axiom approachability ideal Hedetniemi's conjecture Local Club Condensation. Iterated forcing Microscopic Approach stationary reflection O-space Chromatic number very good scale Fodor-type reflection Knaster and friends Cohen real weak square Ascent Path square principles Uniformly coherent Sakurai's Bell inequality SNR Generalized Clubs Subtle tree property Nonspecial tree Prikry-type forcing super-Souslin tree Diamond-sharp Commutative cancellative semigroups positive partition relation Singular Density Reflecting stationary set Almost countably chromatic Cardinal function Well-behaved magma Vanishing levels Constructible Universe coloring number PFA Universal Sequences Analytic sets club_AD square L-space Hindman's Theorem Foundations Almost-disjoint family ZFC construction Fast club Subtle cardinal Ulam matrix Rock n' Roll Square-Brackets Partition Relations Amenable C-sequence Chang's conjecture HOD Cardinal Invariants Distributive tree nonmeager set stick Non-saturation Mandelbrot set Aronszajn tree incompactness Knaster Minimal Walks Hereditarily Lindelöf space Whitehead Problem Souslin Tree Jonsson cardinal Weakly compact cardinal Successor of Regular Cardinal P-Ideal Dichotomy free Boolean algebra Open Access Rainbow sets Prevalent singular cardinals Reduced Power Kurepa Hypothesis Subnormal ideal projective Boolean algebra ccc free Souslin tree Precaliber PFA(S)[S] Luzin set AIM forcing countably metacompact Fat stationary set 54G20 transformations strongly bounded groups Subadditive Partition Relations Was Ulam right weak Kurepa tree Erdos-Hajnal graphs
Category Archives: Blog
A strong form of König’s lemma
A student proposed to me the following strong form of König’s lemma: Conjecture. Suppose that $G=(V,E)$ is a countable a graph, and there is a partition of $V$ into countably many pieces $V=\bigcup_{n<\omega}V_n$, such that: for all $n<\omega$, $V_n$ is … Continue reading
Posted in Blog
2 Comments
Prikry forcing may add a Souslin tree
A celebrated theorem of Shelah states that adding a Cohen real introduces a Souslin tree. Are there any other examples of notions of forcing that add a $\kappa$-Souslin tree? and why is this of interest? My motivation comes from a … Continue reading
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
Leave a comment
Prolific Souslin trees
In a paper from 1971, Erdos and Hajnal asked whether (assuming CH) every coloring witnessing $\aleph_1\nrightarrow[\aleph_1]^2_3$ has a rainbow triangle. The negative solution was given in a 1975 paper by Shelah, and the proof and relevant definitions may be found … Continue reading
Posted in Blog, Expository
Tagged Rainbow sets, Souslin Tree, Square-Brackets Partition Relations
Leave a comment
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
Many diamonds from just one
Recall Jensen’s diamond principle over a stationary subset $S$ of a regular uncountable cardinal $\kappa$: there exists a sequence $\langle A_\alpha\mid \alpha\in S \rangle$ such that $\{\alpha\in S\mid A\cap\alpha=A_\alpha\}$ is stationary for every $A\subseteq\kappa$. Equivalently, there exists a sequence $\langle … 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
Walk on countable ordinals: the characteristics
In this post, we shall present a few aspects of the method of walk on ordinals (focusing on countable ordinals), record its characteristics, and verify some of their properties. All definitions and results in this post are due to Todorcevic. … Continue reading
