Archives
Recent blog posts
- The S-space problem, and the cardinal invariant $\mathfrak b$ April 4, 2013
- An $S$-space from a Cohen real April 3, 2013
- Forcing with a Souslin tree makes $\mathfrak p=\omega_1$ April 1, 2013
- The S-space problem, and the cardinal invariant $\mathfrak p$ March 28, 2013
- Jones’ theorem on the cardinal invariant $\mathfrak p$ March 26, 2013
- Erdős 100 March 26, 2013
- Bell’s theorem on the cardinal invariant $\mathfrak p$ March 21, 2013
- The $\Delta$-system lemma: an elementary proof March 20, 2013
Keywords
approachability ideal Square-Brackets Partition Relations Erdos Cardinal middle diamond Singular Cofinality S-Space square polarized partition relation Forcing Club Guessing Singular Density Whitehead Problem Sakurai's Bell inequality Shelah's Strong Hypothesis Uniformization Minimal Walks Erdos-Hajnal graphs reflection principles Singular cardinals combinatorics Large Cardinals Dushnik-Miller Rock n' Roll Hereditarily Lindelöf space Kurepa Hypothesis Mandelbrot set Diamond P-Ideal Dichotomy Cohen real Chromatic number weak square Non-saturation Poset Souslin Tree b-scale PFA(S)[S] Foundations incompactness diamond star free Boolean algebra Antichain Prevalent singular cardinals Small forcing Prikry-type forcing stationary reflection very good scale Partition Relations weak diamond Ostaszewski square Axiom R projective Boolean algebra Generalized Clubs sap stationary hitting Aronszajn tree Successor of Regular Cardinal Rainbow sets Knaster Successor of Singular Cardinal Rado's conjecture Cardinal function Almost countably chromatic
Tag Archives: 03E35
Chromatic numbers of graphs – large gaps
Abstract. We say that a graph $G$ is $(\aleph_0,\kappa)$-chromatic if $\text{Chr}(G)=\kappa$, while $\text{Chr}(G’)\le\aleph_0$ for any subgraph $G’$ of $G$ of size $<|G|$. The main result of this paper reads as follows. If $\square_\lambda+\text{CH}_\lambda$ holds for a given uncountable cardinal $\lambda$, … Continue reading
Posted in Preprints, Publications
Tagged 03E35, 05C15, 05C63, Almost countably chromatic, Chromatic number, incompactness, Ostaszewski square
3 Comments
Jensen’s diamond principle and its relatives
This is chapter 6 in the book Set Theory and Its Applications (ISBN: 0821848127). Abstract: We survey some recent results on the validity of Jensen’s diamond principle at successor cardinals. We also discuss weakening of this principle such as club … Continue reading
A cofinality-preserving small forcing may introduce a special Aronszajn tree
Extended Abstract: Shelah proved that Cohen forcing introduces a Souslin tree; Jensen proved that a c.c.c. forcing may consistently add a Kurepa tree; Todorcevic proved that a Knaster poset may already force the Kurepa hypothesis; Irrgang introduced a c.c.c. notion … Continue reading
Posted in Publications
Tagged 03E04, 03E05, 03E35, Aronszajn tree, Small forcing, Successor of Singular Cardinal, weak square
Leave a comment
Openly generated Boolean algebras and the Fodor-type reflection principle
Joint work with Sakaé Fuchino. Abstract: We prove that the Fodor-type Reflection Principle (FRP) is equivalent to the assertion that any Boolean algebra is openly generated if and only if it is $\aleph _2$-projective. Previously it was known that this … Continue reading
The failure of diamond on a reflecting stationary set
Joint work with Moti Gitik. Abstract: It is shown that the failure of $\diamondsuit_S$, for a subset $S\subseteq\aleph_{\omega+1}$ that reflects stationarily often, is consistent with GCH and $\text{AP}_{\aleph_\omega}$, relatively to the existence of a supercompact cardinal. This should be comapred with … Continue reading
A relative of the approachability ideal, diamond and non-saturation
Abstract: Let $\lambda$ denote a singular cardinal. Zeman, improving a previous result of Shelah, proved that $\square^*_\lambda$ together with $2^\lambda=\lambda^+$ implies $\diamondsuit_S$ for every $S\subseteq\lambda^+$ that reflects stationarily often. In this paper, for a subset $S\subset\lambda^+$, a normal subideal of … Continue reading
On guessing generalized clubs at the successors of regulars
Abstract: Konig, Larson and Yoshinobu initiated the study of principles for guessing generalized clubs, and introduced a construction of an higher Souslin tree from the strong guessing principle. Complementary to the author’s work on the validity of diamond and non-saturation … Continue reading
Antichains in partially ordered sets of singular cofinality
Abstract: In their paper from 1981, Milner and Sauer conjectured that for any poset $\mathbb P$, if $\text{cf}(\mathbb P)$ is a singular cardinal $\lambda$, then $\mathbb P$ must contain an antichain of size $\text{cf}(\lambda)$. The main result of of this … Continue reading
Posted in Publications
Tagged 03E04, 03E35, 06A07, Antichain, Poset, Singular Cofinality
Leave a comment
The Ostaszewski square, and homogeneous Souslin trees
Abstract: Assume GCH and let $\lambda$ denote an uncountable cardinal. We prove that if $\square_\lambda$ holds, then this may be witnessed by a coherent sequence $\left\langle C_\alpha \mid \alpha<\lambda^+\right\rangle$ with the following remarkable guessing property: For every sequence $\langle A_i\mid i<\lambda\rangle$ … Continue reading
Posted in Preprints, Publications
Tagged 03E05, 03E35, Club Guessing, Ostaszewski square, Souslin Tree
2 Comments