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