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