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