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