Archives
Keywords
Dushnik-Miller Hedetniemi's conjecture Closed coloring club_AD Erdos Cardinal Chromatic number S-Space Diamond-sharp Hereditarily Lindelöf space Jonsson cardinal Square-Brackets Partition Relations Knaster Large Cardinals Intersection model higher Baire space Iterated forcing Slim tree Non-saturation Open Access weak Kurepa tree Strong coloring Fodor-type reflection Whitehead Problem specializable Souslin tree Shelah's Strong Hypothesis indecomposable ultrafilter middle diamond Uniformly homogeneous stationary reflection reflection principles Reduced Power Almost Souslin Antichain Fat stationary set Ascent Path Sigma-Prikry C-sequence super-Souslin tree weak diamond Foundations Absoluteness unbounded function Subtle cardinal square Almost-disjoint family Axiom R Strongly Luzin set Parameterized proxy principle GMA Club Guessing regressive Souslin tree Sierpinski's onto mapping principle Selective Ultrafilter P-Ideal Dichotomy stick free Boolean algebra Filter reflection Poset Strongly compact cardinal Kurepa Hypothesis approachability ideal Aronszajn tree Reflecting stationary set square principles coloring number nonmeager set Constructible Universe Martin's Axiom ZFC construction Uniformly coherent tensor product graph positive partition relation Countryman line Rainbow sets weak square O-space Nonspecial tree Singular cofinality Successor of Regular Cardinal Weakly compact cardinal PFA Microscopic Approach Cardinal function free Souslin tree ccc Rock n' Roll transformations OCA Rado's conjecture Diamond Subnormal ideal Well-behaved magma Fast club stationary hitting Sakurai's Bell inequality Uniformization Chang's conjecture Generalized Clubs Commutative projection system Successor of Singular Cardinal Forcing Axioms Ramsey theory over partitions incompactness strongly bounded groups Singular cardinals combinatorics very good scale Subtle tree property Commutative cancellative semigroups Universal Sequences Forcing Local Club Condensation. Precaliber Ineffable cardinal Singular Density Diamond for trees Analytic sets Ostaszewski square HOD Amenable C-sequence AIM forcing Almost countably chromatic Cohen real diamond star Postprocessing function Respecting tree xbox Lipschitz reduction b-scale Knaster and friends Souslin Tree Distributive tree Prevalent singular cardinals Minimal Walks Dowker space polarized partition relation Erdos-Hajnal graphs Subadditive L-space Luzin set 54G20 PFA(S)[S] Ulam matrix Prikry-type forcing Generalized descriptive set theory projective Boolean algebra sap Mandelbrot set full tree countably metacompact Partition Relations Small forcing Hindman's Theorem Coherent tree Greatly Mahlo Vanishing levels Was Ulam right? SNR Cardinal Invariants
Tag Archives: Minimal Walks
MFO workshop in Set Theory, January 2014
I gave an invited talk at the Set Theory workshop in Obwerwolfach, January 2014. Talk Title: Complicated Colorings. Abstract: If
Walk on countable ordinals: the characteristics
In this post, we shall present a few aspects of the method of walk on ordinals (focusing on countable ordinals), record its characteristics, and verify some of their properties. All definitions and results in this post are due to Todorcevic. … Continue reading
Rectangular square-bracket operation for successor of regular cardinals
Joint work with Stevo Todorcevic. Extended Abstract: Consider the coloring statement
Young Researchers in Set Theory, March 2011
These are the slides of a talk I gave at the Young Researchers in Set Theory 2011 meeting (Königswinter, 21–25 March 2011). Talk Title: Around Jensen’s square principle Abstract: Jensen‘s square principle for a cardinal
Transforming rectangles into squares, with applications to strong colorings
Abstract: It is proved that every singular cardinal
