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