Archives
Keywords
Strongly Luzin set Local Club Condensation. Almost Souslin Minimal Walks xbox incompactness Interval topology on trees HOD Entangled linear order regressive Souslin tree super-Souslin tree very good scale stationary reflection Subadditive Martin's Axiom Distributive tree Strongly compact cardinal Hereditarily Lindelöf space Weakly compact cardinal SNR Open Access tensor product graph Filter reflection S-Space Luzin set Square-Brackets Partition Relations Forcing with side conditions Kurepa Hypothesis Mandelbrot set Commutative projection system Microscopic Approach Prikry-type forcing Subtle tree property Nonspecial tree Successor of Singular Cardinal Coherent tree GMA Forcing Ulam matrix Rainbow sets Reflecting stationary set Generalized Clubs Almost countably chromatic Subtle cardinal Generalized descriptive set theory projective Boolean algebra P-Ideal Dichotomy O-space AIM forcing positive partition relation transformations Large Cardinals Fast club Antichain Ramsey theory over partitions Partition Relations countably metacompact Reduced Power Was Ulam right? Constructible Universe square principles Strong coloring Precaliber Cardinal function reflection principles Fat stationary set Erdos-Hajnal graphs Club Guessing Cohen real Sierpinski's onto mapping principle club_AD PFA Parameterized proxy principle nonmeager set Dushnik-Miller Universal Sequences Diamond-sharp 54G20 weak diamond Subnormal ideal free Boolean algebra Rado's conjecture Iterated forcing Analytic sets Vanishing levels diamond star Partition relations for trees Successor of Regular Cardinal Shelah's Strong Hypothesis Foundations Ineffable cardinal Diamond Axiom R L-space Fodor-type reflection full tree Countryman line Uniformization Well-behaved magma Postprocessing function stick weak Kurepa tree Ostaszewski square higher Baire space Singular Density Souslin Tree Uniformly coherent Selective Ultrafilter Absoluteness Diamond for trees sap Chang's conjecture Closed coloring Ascending path Almost-disjoint family Uniformly homogeneous Cardinal Invariants middle diamond C-sequence Amenable C-sequence free Souslin tree Small forcing polarized partition relation Singular cofinality ZFC construction Ascent Path Respecting tree b-scale PFA(S)[S] Commutative cancellative semigroups Sakurai's Bell inequality perfectly normal Singular cardinals combinatorics Lipschitz reduction Chromatic number OCA coloring number strongly bounded groups specializable Souslin tree Prevalent singular cardinals Erdos Cardinal stationary hitting Hedetniemi's conjecture Non-saturation approachability ideal Dowker space Knaster Poset Knaster and friends Jonsson cardinal square indecomposable filter Forcing Axioms Rock n' Roll Aronszajn tree Hindman's Theorem Greatly Mahlo Whitehead Problem Slim tree unbounded function Sigma-Prikry weak square Intersection model ccc Monotonically far
Tag Archives: Shelah’s Strong Hypothesis
Logic in Hungary, August 2005
These are the slides of a contributed talk given at the Logic in Hungary 2005 meeting (Budapest, 5–11 August 2005). Talk Title: On the consistency strength of the Milner-Sauer Conjecture Abstract: In their paper from 1981, after learning about Pouzet‘s theorem that any … Continue reading
Posted in Contributed Talks
Tagged Antichain, Shelah's Strong Hypothesis, Singular cofinality
Leave a comment
A topological reflection principle equivalent to Shelah’s strong hypothesis
Abstract: We notice that Shelah’s Strong Hypothesis (SSH) is equivalent to the following reflection principle: Suppose $\mathbb X$ is an (infinite) first-countable space whose density is a regular cardinal, $\kappa$. If every separable subspace of $\mathbb X$ is of cardinality at most … Continue reading
Posted in Compactness, Publications, Topology
Tagged 03E04, 03E65, 54G15, Open Access, Shelah's Strong Hypothesis
Comments Off on A topological reflection principle equivalent to Shelah’s strong hypothesis
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
Posted in Compactness, Publications
Tagged 03E35, 03E55, 03E65, 03E75, 03G05, 06E05, Axiom R, Fodor-type reflection, free Boolean algebra, projective Boolean algebra, Shelah's Strong Hypothesis, stationary reflection
Comments Off on Openly generated Boolean algebras and the Fodor-type reflection principle
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
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
