Archives
Keywords
Sakurai's Bell inequality Fodor-type reflection Vanishing levels Commutative projection system Almost Souslin free Boolean algebra Slim tree indecomposable ultrafilter Selective Ultrafilter Luzin set S-Space Fast club Coherent tree Iterated forcing Knaster and friends coloring number approachability ideal Minimal Walks Almost countably chromatic transformations Local Club Condensation. Constructible Universe Strongly compact cardinal specializable Souslin tree weak square SNR Ramsey theory over partitions full tree Almost-disjoint family Closed coloring Foundations Open Access Axiom R Singular cardinals combinatorics Subnormal ideal C-sequence Knaster Sierpinski's onto mapping principle sap Non-saturation Ulam matrix diamond star unbounded function stationary hitting Precaliber Poset strongly bounded groups positive partition relation Mandelbrot set Ascent Path Dushnik-Miller Hereditarily Lindelöf space Antichain Reflecting stationary set Rainbow sets Commutative cancellative semigroups Uniformly coherent Intersection model square Uniformly homogeneous Hedetniemi's conjecture weak Kurepa tree incompactness Cardinal Invariants Universal Sequences projective Boolean algebra stick Jonsson cardinal middle diamond xbox Cardinal function Strongly Luzin set Generalized Clubs Respecting tree Fat stationary set Distributive tree ZFC construction Dowker space L-space Whitehead Problem weak diamond GMA Ineffable cardinal Diamond-sharp tensor product graph Diamond for trees polarized partition relation Prikry-type forcing Forcing Axioms O-space Was Ulam right? Well-behaved magma Subtle cardinal higher Baire space Subadditive Microscopic Approach Analytic sets Singular cofinality stationary reflection Square-Brackets Partition Relations free Souslin tree Prevalent singular cardinals Reduced Power Shelah's Strong Hypothesis countably metacompact Erdos-Hajnal graphs square principles Hindman's Theorem ccc Uniformization Erdos Cardinal AIM forcing Martin's Axiom P-Ideal Dichotomy Rock n' Roll nonmeager set PFA b-scale Aronszajn tree Successor of Regular Cardinal Large Cardinals Parameterized proxy principle Club Guessing Filter reflection Sigma-Prikry Forcing Kurepa Hypothesis Ostaszewski square Postprocessing function PFA(S)[S] Generalized descriptive set theory Souslin Tree Greatly Mahlo Successor of Singular Cardinal club_AD Countryman line regressive Souslin tree Singular Density Lipschitz reduction super-Souslin tree Partition Relations Cohen real Absoluteness Rado's conjecture very good scale Subtle tree property Weakly compact cardinal reflection principles Chromatic number Strong coloring Nonspecial tree HOD Amenable C-sequence Diamond 54G20 OCA Small forcing Chang's conjecture
Tag Archives: Intersection model
A new model for all C-sequences are trivial
Joint work with Zhixing You and Jiachen Yuan. Abstract. We construct a model in which all C-sequences are trivial, yet there exists a
Posted in Compactness, Preprints
Tagged Ascent Path, C-sequence, Intersection model, Souslin Tree, Vanishing levels
Comments Off on A new model for all C-sequences are trivial
Ketonen’s question and other cardinal sins
Joint work with Zhixing You and Jiachen Yuan. Abstract. Intersection models of generic extensions obtained from a commutative projection systems of notions of forcing has recently regained interest, especially in the study of descriptive set theory. Here, we show that … Continue reading
Posted in Compactness, Preprints
Tagged 03E05, 03E35, 03E55, Ascent Path, C-sequence, Commutative projection system, indecomposable ultrafilter, Intersection model, Strongly compact cardinal
Comments Off on Ketonen’s question and other cardinal sins
