Archives
Keywords
specializable Souslin tree Monotonically far Precaliber Martin's Axiom Erdos Cardinal Antichain square Shelah's Strong Hypothesis Rock n' Roll xbox Commutative cancellative semigroups Generalized Clubs Analytic sets Prikry-type forcing Mandelbrot set Partition Relations Uniformization Ascent Path Reflecting stationary set Absoluteness strongly bounded groups free Souslin tree Vanishing levels Diamond for trees Reduced Power perfectly normal Open Access b-scale OCA PFA higher Baire space Subnormal ideal Forcing Ramsey theory over partitions Partition relations for trees Non-saturation Whitehead Problem Amenable C-sequence Jonsson cardinal Sigma-Prikry Diamond-sharp very good scale full tree Generalized descriptive set theory Hindman's Theorem Microscopic Approach reflection principles Was Ulam right? Dushnik-Miller tensor product graph incompactness transformations Rainbow sets Singular Density nonmeager set Kurepa Hypothesis unbounded function Ascending path Lipschitz reduction polarized partition relation Postprocessing function Selective Ultrafilter 54G20 Intersection model Fodor-type reflection Axiom R stick ZFC construction Knaster and friends Chromatic number L-space coloring number Subtle tree property Subadditive Erdos-Hajnal graphs Strongly Luzin set Cardinal Invariants S-Space Hereditarily Lindelöf space Sierpinski's onto mapping principle Knaster Singular cardinals combinatorics Souslin Tree Distributive tree Forcing with side conditions AIM forcing Iterated forcing Successor of Regular Cardinal weak diamond stationary reflection Constructible Universe Local Club Condensation. Slim tree Singular cofinality Luzin set Universal Sequences Sakurai's Bell inequality Greatly Mahlo Respecting tree Minimal Walks GMA Uniformly coherent Aronszajn tree Interval topology on trees Strongly compact cardinal Fat stationary set square principles ccc Forcing Axioms Ineffable cardinal Rado's conjecture Coherent tree sap Club Guessing Weakly compact cardinal Fast club Strong coloring Entangled linear order Uniformly homogeneous Large Cardinals Well-behaved magma indecomposable filter Square-Brackets Partition Relations projective Boolean algebra P-Ideal Dichotomy C-sequence SNR O-space Almost countably chromatic Cardinal function super-Souslin tree Filter reflection Diamond Hedetniemi's conjecture Prevalent singular cardinals Cohen real Ostaszewski square countably metacompact diamond star Almost Souslin club_AD Dowker space Successor of Singular Cardinal positive partition relation Foundations Closed coloring approachability ideal Poset Countryman line Almost-disjoint family Subtle cardinal middle diamond HOD weak Kurepa tree free Boolean algebra regressive Souslin tree Parameterized proxy principle Nonspecial tree weak square Commutative projection system Chang's conjecture stationary hitting Small forcing PFA(S)[S] Ulam matrix
Category Archives: Publications
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
On the consistency strength of the Milner-Sauer conjecture
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 conjecture is consistent and known … Continue reading
Transforming rectangles into squares, with applications to strong colorings
Abstract: It is proved that every singular cardinal $\lambda$ admits a function $\textbf{rts}:[\lambda^+]^2\rightarrow[\lambda^+]^2$ that transforms rectangles into squares. That is, whenever $A,B$ are cofinal subsets of $\lambda^+$, we have $\textbf{rts}[A\circledast B]\supseteq C\circledast C$, for some cofinal subset $C\subseteq\lambda^+$. As a … 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, Singular Cardinals Combinatorics
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 Publications, Souslin Hypothesis, Squares and Diamonds
Tagged 03E05, 03E35, Club Guessing, Fat stationary set, Ostaszewski square, Souslin Tree
5 Comments
