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