Archives
Keywords
Slim tree Diamond for trees Subnormal ideal Square-Brackets Partition Relations Forcing Singular Density Subtle cardinal Mandelbrot set Filter reflection Diamond Fodor-type reflection Large Cardinals Microscopic Approach Fast club Shelah's Strong Hypothesis S-Space 54G20 square Uniformization coloring number OCA Diamond-sharp SNR Countryman line L-space Almost countably chromatic Postprocessing function xbox O-space Universal Sequences Forcing Axioms Sigma-Prikry Martin's Axiom Souslin Tree Reduced Power Uniformly homogeneous Small forcing stick Singular cofinality Weakly compact cardinal Prevalent singular cardinals Absoluteness Successor of Regular Cardinal Chromatic number square principles incompactness Precaliber Commutative cancellative semigroups Cardinal Invariants transformations polarized partition relation Singular cardinals combinatorics Sierpinski's onto mapping principle Constructible Universe Sakurai's Bell inequality nonmeager set Erdos Cardinal Club Guessing Distributive tree Nonspecial tree Lipschitz reduction Fat stationary set Amenable C-sequence Axiom R countably metacompact Closed coloring b-scale Coherent tree Ramsey theory over partitions Commutative projection system free Souslin tree free Boolean algebra Generalized descriptive set theory Greatly Mahlo ZFC construction Ulam matrix Knaster Subtle tree property Foundations Uniformly coherent Almost Souslin regressive Souslin tree positive partition relation Erdos-Hajnal graphs Hedetniemi's conjecture AIM forcing Dowker space Ineffable cardinal Successor of Singular Cardinal Ostaszewski square C-sequence Antichain projective Boolean algebra Local Club Condensation. Vanishing levels Strongly Luzin set Jonsson cardinal Aronszajn tree stationary hitting Generalized Clubs Almost-disjoint family stationary reflection super-Souslin tree strongly bounded groups full tree reflection principles Well-behaved magma GMA unbounded function weak diamond club_AD Rado's conjecture Chang's conjecture Intersection model Parameterized proxy principle Minimal Walks Ascent Path specializable Souslin tree Hindman's Theorem HOD weak Kurepa tree Non-saturation Strong coloring Respecting tree Hereditarily Lindelöf space Strongly compact cardinal PFA(S)[S] weak square diamond star PFA sap P-Ideal Dichotomy Cardinal function Knaster and friends Kurepa Hypothesis Partition Relations Analytic sets tensor product graph Selective Ultrafilter Poset very good scale Open Access higher Baire space Was Ulam right? Iterated forcing Reflecting stationary set Prikry-type forcing Rainbow sets approachability ideal middle diamond Whitehead Problem Subadditive Cohen real Rock n' Roll Dushnik-Miller indecomposable ultrafilter Luzin set ccc
Tag Archives: square principles
Proxy principles in combinatorial set theory
Joint work with Ari Meir Brodsky and Shira Yadai. Abstract. The parameterized proxy principles were introduced by Brodsky and Rinot in a 2017 paper as new foundations for the construction of
Winter School in Abstract Analysis, January 2023
I gave a 3-lecture tutorial at the Winter School in Abstract Analysis in Steken, January 2023. Title: Club guessing Abstract. Club guessing principles were introduced by Shelah as a weakening of Jensen’s diamond. Most spectacularly, they were used to prove … Continue reading
A microscopic approach to Souslin-tree constructions. Part II
Joint work with Ari Meir Brodsky. Abstract. In Part I of this series, we presented the microscopic approach to Souslin-tree constructions, and argued that all known
Distributive Aronszajn trees
Joint work with Ari Meir Brodsky. Abstract. Ben-David and Shelah proved that if
ASL North American Meeting, March 2017
I gave a plenary talk at the 2017 ASL North American Meeting in Boise, March 2017. Talk Title: The current state of the Souslin problem. Abstract: Recall that the real line is that unique separable, dense linear ordering with no endpoints in … Continue reading
