Archives
Keywords
transformations Rado's conjecture Non-saturation Commutative projection system Weakly compact cardinal Sierpinski's onto mapping principle SNR Coherent tree Singular cardinals combinatorics incompactness Luzin set OCA Hereditarily Lindelöf space Nonspecial tree Ineffable cardinal indecomposable ultrafilter weak Kurepa tree Kurepa Hypothesis Fast club Rock n' Roll Subadditive coloring number Subnormal ideal Diamond-sharp O-space middle diamond Ostaszewski square Subtle tree property Analytic sets Rainbow sets weak square Strongly compact cardinal Open Access strongly bounded groups Postprocessing function weak diamond Sigma-Prikry Club Guessing Small forcing Forcing Axioms Uniformly coherent Countryman line full tree Reflecting stationary set Cardinal function Parameterized proxy principle Almost countably chromatic Successor of Regular Cardinal Distributive tree Filter reflection polarized partition relation b-scale Singular Density Ulam matrix Vanishing levels Hedetniemi's conjecture Singular cofinality Dushnik-Miller Foundations PFA(S)[S] Shelah's Strong Hypothesis Fodor-type reflection Whitehead Problem diamond star square specializable Souslin tree Selective Ultrafilter unbounded function Aronszajn tree Ramsey theory over partitions GMA Generalized descriptive set theory approachability ideal L-space 54G20 Iterated forcing HOD nonmeager set club_AD very good scale Precaliber C-sequence P-Ideal Dichotomy Slim tree Uniformization Uniformly homogeneous stationary reflection Prevalent singular cardinals Microscopic Approach Cardinal Invariants Minimal Walks Martin's Axiom sap Local Club Condensation. ccc Generalized Clubs stationary hitting Knaster Jonsson cardinal projective Boolean algebra higher Baire space Souslin Tree Chromatic number Dowker space Cohen real Large Cardinals Partition Relations Almost-disjoint family Forcing Hindman's Theorem Amenable C-sequence free Souslin tree xbox Knaster and friends Strongly Luzin set Respecting tree S-Space super-Souslin tree Ascent Path tensor product graph Fat stationary set AIM forcing Commutative cancellative semigroups Closed coloring Chang's conjecture Diamond for trees Reduced Power Absoluteness Mandelbrot set Sakurai's Bell inequality Diamond Strong coloring Was Ulam right? Erdos Cardinal Greatly Mahlo countably metacompact Almost Souslin Poset Successor of Singular Cardinal reflection principles Subtle cardinal regressive Souslin tree stick Square-Brackets Partition Relations Axiom R Intersection model free Boolean algebra Lipschitz reduction Universal Sequences Constructible Universe square principles ZFC construction Well-behaved magma positive partition relation Prikry-type forcing PFA Antichain Erdos-Hajnal graphs
Blog Archives
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
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
A remark on Schimmerling’s question
Joint work with Ari Meir Brodsky. Abstract. Schimmerling asked whether
Distributive Aronszajn trees
Joint work with Ari Meir Brodsky. Abstract. Ben-David and Shelah proved that if
More notions of forcing add a Souslin tree
Joint work with Ari Meir Brodsky. Abstract. An
A microscopic approach to Souslin-tree constructions. Part I
Joint work with Ari Meir Brodsky. Abstract. We propose a parameterized proxy principle from which
Posted in Publications, Souslin Hypothesis
Tagged 03E05, 03E35, 03E65, 05C05, Coherent tree, Diamond, Microscopic Approach, Parameterized proxy principle, Slim tree, Souslin Tree, square, xbox
5 Comments
Reduced powers of Souslin trees
Joint work with Ari Meir Brodsky. Abstract. We study the relationship between a
