Archives
Keywords
Universal Sequences Coherent tree Cardinal Invariants Reduced Power Club Guessing Parameterized proxy principle specializable Souslin tree AIM forcing b-scale Foundations Amenable C-sequence Forcing reflection principles super-Souslin tree Ascent Path Rainbow sets higher Baire space Microscopic Approach PFA Poset Ramsey theory over partitions Kurepa Hypothesis Constructible Universe Postprocessing function Aronszajn tree Precaliber Martin's Axiom approachability ideal Diamond free Boolean algebra Strongly Luzin set Singular Density Fat stationary set Prevalent singular cardinals Hereditarily Lindelöf space Commutative projection system Well-behaved magma Luzin set Dushnik-Miller Strongly compact cardinal Strong coloring Large Cardinals Respecting tree Lipschitz reduction regressive Souslin tree Sigma-Prikry polarized partition relation Erdos Cardinal Commutative cancellative semigroups full tree indecomposable ultrafilter Closed coloring Prikry-type forcing Generalized descriptive set theory S-Space transformations Antichain Successor of Singular Cardinal Souslin Tree P-Ideal Dichotomy Chang's conjecture Ineffable cardinal Almost countably chromatic Fodor-type reflection diamond star 54G20 Uniformization Ostaszewski square Analytic sets Filter reflection positive partition relation Axiom R Fast club Non-saturation strongly bounded groups Generalized Clubs Diamond-sharp weak Kurepa tree Distributive tree L-space Minimal Walks weak diamond Hindman's Theorem Rock n' Roll unbounded function Countryman line Dowker space Subadditive Subtle cardinal nonmeager set square stationary reflection C-sequence Knaster Nonspecial tree Forcing Axioms middle diamond Greatly Mahlo Singular cardinals combinatorics Was Ulam right? Hedetniemi's conjecture Knaster and friends sap Local Club Condensation. Intersection model GMA Jonsson cardinal ZFC construction Diamond for trees projective Boolean algebra Whitehead Problem Slim tree Almost Souslin Singular cofinality Rado's conjecture free Souslin tree Reflecting stationary set ccc Selective Ultrafilter Shelah's Strong Hypothesis Absoluteness Sakurai's Bell inequality Almost-disjoint family square principles Cardinal function Uniformly homogeneous coloring number Successor of Regular Cardinal Open Access HOD Erdos-Hajnal graphs Uniformly coherent Partition Relations Chromatic number countably metacompact incompactness Small forcing stationary hitting Subtle tree property SNR very good scale club_AD Mandelbrot set O-space Cohen real Subnormal ideal Square-Brackets Partition Relations Ulam matrix xbox weak square tensor product graph Weakly compact cardinal Iterated forcing OCA Sierpinski's onto mapping principle PFA(S)[S] stick Vanishing levels
Tag Archives: Sierpinski’s onto mapping principle
Was Ulam right? I: Basic theory and subnormal ideals
Joint work with Tanmay Inamdar. Abstract. We introduce various coloring principles which generalize the so-called onto mapping principle of Sierpinski to larger cardinals and general ideals. We prove that these principles capture the notion of an Ulam matrix and allow … Continue reading
Ramsey theory over partitions III: Strongly Luzin sets and partition relations
Joint work with Menachem Kojman and Juris Steprāns. Abstract. The strongest type of coloring of pairs of countable ordinals, gotten by Todorcevic from a strongly Luzin set, is shown to be equivalent to the existence of a nonmeager set of … Continue reading
Jones’ theorem on the cardinal invariant
This post continues the study of the cardinal invariant
Posted in Blog, Expository
Tagged polarized partition relation, Sierpinski's onto mapping principle
Leave a comment
