Archives
Keywords
incompactness coloring number Axiom R Constructible Universe Ramsey theory over partitions S-Space Ineffable cardinal Hedetniemi's conjecture Rainbow sets Diamond for trees Strongly compact cardinal Subadditive countably metacompact Strongly Luzin set Iterated forcing Open Access Foundations Poset Rock n' Roll P-Ideal Dichotomy sap free Souslin tree Almost-disjoint family reflection principles Closed coloring Monotonically far Cohen real Partition Relations Successor of Singular Cardinal Large Cardinals PFA Almost Souslin PFA(S)[S] xbox nonmeager set Mandelbrot set Dushnik-Miller Entangled linear order Luzin set Cardinal function Respecting tree Subtle cardinal Non-saturation Was Ulam right? super-Souslin tree Singular Density Antichain Erdos Cardinal Uniformly homogeneous very good scale Weakly compact cardinal HOD Commutative cancellative semigroups club_AD Sakurai's Bell inequality Subtle tree property Nonspecial tree Successor of Regular Cardinal Cardinal Invariants Martin's Axiom Slim tree Prikry-type forcing polarized partition relation weak square Distributive tree Whitehead Problem square Countryman line Generalized descriptive set theory Coherent tree Interval topology on trees Microscopic Approach Fat stationary set Greatly Mahlo Chang's conjecture Square-Brackets Partition Relations Partition relations for trees Jonsson cardinal Sigma-Prikry Uniformization Strong coloring Kurepa Hypothesis unbounded function Precaliber AIM forcing Singular cofinality stick Postprocessing function Knaster and friends Ulam matrix Reduced Power weak Kurepa tree Hindman's Theorem approachability ideal GMA strongly bounded groups Forcing with side conditions Parameterized proxy principle Subnormal ideal 54G20 full tree free Boolean algebra ZFC construction b-scale Ostaszewski square Minimal Walks indecomposable filter weak diamond stationary hitting transformations L-space Rado's conjecture Selective Ultrafilter ccc C-sequence higher Baire space regressive Souslin tree Singular cardinals combinatorics Small forcing Souslin Tree Knaster Erdos-Hajnal graphs O-space Intersection model Hereditarily Lindelöf space Well-behaved magma positive partition relation Reflecting stationary set Diamond perfectly normal Fodor-type reflection tensor product graph specializable Souslin tree Uniformly coherent Sierpinski's onto mapping principle SNR Ascent Path Shelah's Strong Hypothesis projective Boolean algebra Almost countably chromatic Universal Sequences stationary reflection Fast club Dowker space Aronszajn tree Forcing Absoluteness Commutative projection system Analytic sets Diamond-sharp Amenable C-sequence Local Club Condensation. middle diamond Filter reflection Ascending path square principles Chromatic number diamond star Forcing Axioms Lipschitz reduction Club Guessing Generalized Clubs Vanishing levels Prevalent singular cardinals OCA
This is certainly not a pipe.
Shana Tova.
I made my way here via Deborah Mayo’s sanctuary for frequentists like me, then to Booles Rings, to Carl Mummert’s home. Carl is a friendly face from mathoverflow.
This is a lovely, amusing post, yet there were no up votes! I tried to address that. Yes, I am Jewish. I smiled. Thank you.
Thanks a lot, Ellie, for such a friendly comment. I guess the lack of upvotes tells us that the intersection of the following three sets is nearly empty: 1. Blog visitors. 2. Magritte fans. 3. Shofar recognizers.
Really? Empty?
I suppose that I don’t visit your blog then. 😛
nearly empty.