Archives
Keywords
Diamond-sharp Successor of Singular Cardinal weak Kurepa tree stationary reflection Singular cardinals combinatorics indecomposable ultrafilter Dowker space free Boolean algebra Fat stationary set higher Baire space PFA reflection principles Martin's Axiom L-space Generalized descriptive set theory full tree ZFC construction weak diamond Fodor-type reflection Fast club GMA Partition Relations Well-behaved magma Large Cardinals P-Ideal Dichotomy Sigma-Prikry Hindman's Theorem Prikry-type forcing Postprocessing function countably metacompact Souslin Tree Foundations transformations SNR Axiom R Erdos Cardinal Chromatic number super-Souslin tree Parameterized proxy principle Ostaszewski square Chang's conjecture polarized partition relation Kurepa Hypothesis incompactness Universal Sequences O-space Forcing Axioms Sierpinski's onto mapping principle Uniformly homogeneous diamond star Antichain coloring number positive partition relation Strongly compact cardinal Cardinal function Sakurai's Bell inequality b-scale ccc Prevalent singular cardinals stick Successor of Regular Cardinal Was Ulam right Subadditive Ineffable cardinal OCA Dushnik-Miller Strongly Luzin set Minimal Walks club_AD middle diamond Closed coloring Intersection model Local Club Condensation. Club Guessing Almost-disjoint family square principles Coherent tree Rock n' Roll Uniformly coherent Commutative projection system Precaliber Subnormal ideal Rainbow sets Singular cofinality Filter reflection specializable Souslin tree Iterated forcing Forcing Distributive tree Diamond Reduced Power Square-Brackets Partition Relations Subtle cardinal tensor product graph Generalized Clubs Cardinal Invariants Absoluteness Analytic sets approachability ideal Weakly compact cardinal Erdos-Hajnal graphs Shelah's Strong Hypothesis Singular Density Whitehead Problem unbounded function Almost Souslin 54G20 C-sequence Aronszajn tree PFA(S)[S] Cohen real Knaster and friends Jonsson cardinal S-Space HOD Respecting tree Lipschitz reduction Strong coloring strongly bounded groups Small forcing nonmeager set Hedetniemi's conjecture Ramsey theory over partitions Greatly Mahlo Microscopic Approach Poset sap Open Access Mandelbrot set xbox free Souslin tree Luzin set square Slim tree very good scale projective Boolean algebra stationary hitting Amenable C-sequence Diamond for trees Hereditarily Lindelöf space Vanishing levels Nonspecial tree Rado's conjecture Almost countably chromatic Knaster Uniformization Ulam matrix Reflecting stationary set AIM forcing Ascent Path regressive Souslin tree weak square Subtle tree property Selective Ultrafilter Non-saturation Countryman line Constructible Universe Commutative cancellative semigroups
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
