Archives
Keywords
Ineffable cardinal Subtle tree property Subtle cardinal C-sequence Sierpinski's onto mapping principle tensor product graph Postprocessing function Erdos Cardinal Parameterized proxy principle Kurepa Hypothesis Dushnik-Miller PFA higher Baire space Partition relations for trees Foundations Strongly compact cardinal regressive Souslin tree approachability ideal S-Space L-space Interval topology on trees Ostaszewski square incompactness free Boolean algebra diamond star Fat stationary set very good scale Ulam matrix stationary hitting Rainbow sets Entangled linear order perfectly normal Fodor-type reflection Subnormal ideal super-Souslin tree square principles Mandelbrot set Hereditarily Lindelöf space xbox Microscopic Approach specializable Souslin tree reflection principles Almost Souslin weak Kurepa tree nonmeager set Ascending path Uniformly coherent Well-behaved magma unbounded function Diamond Erdos-Hajnal graphs Weakly compact cardinal Martin's Axiom Knaster and friends Jonsson cardinal weak diamond AIM forcing Commutative cancellative semigroups Club Guessing Luzin set Cardinal function Countryman line Fast club Iterated forcing Uniformization Hedetniemi's conjecture Strongly Luzin set Antichain Vanishing levels Greatly Mahlo Souslin Tree indecomposable filter OCA Non-saturation Shelah's Strong Hypothesis Amenable C-sequence countably metacompact Minimal Walks Successor of Regular Cardinal Almost-disjoint family Small forcing HOD Forcing Axioms P-Ideal Dichotomy sap Successor of Singular Cardinal Absoluteness Reflecting stationary set Intersection model Strong coloring Ramsey theory over partitions Cohen real polarized partition relation stationary reflection Square-Brackets Partition Relations O-space GMA Sakurai's Bell inequality free Souslin tree Poset Respecting tree Distributive tree Sigma-Prikry Singular cofinality Prikry-type forcing Lipschitz reduction Knaster middle diamond Nonspecial tree Filter reflection Partition Relations Singular Density transformations positive partition relation Local Club Condensation. Uniformly homogeneous Generalized Clubs Closed coloring Almost countably chromatic Was Ulam right? Universal Sequences square stick Monotonically far Hindman's Theorem Coherent tree ccc club_AD b-scale Slim tree projective Boolean algebra Constructible Universe weak square Rado's conjecture Open Access coloring number SNR Prevalent singular cardinals Aronszajn tree Singular cardinals combinatorics Diamond-sharp Generalized descriptive set theory Diamond for trees Chang's conjecture Large Cardinals strongly bounded groups full tree Rock n' Roll Precaliber ZFC construction Cardinal Invariants Subadditive 54G20 Ascent Path PFA(S)[S] Forcing Analytic sets Axiom R Whitehead Problem Dowker space Reduced Power Commutative projection system Selective Ultrafilter Forcing with side conditions Chromatic number
Tag Archives: square principles
More notions of forcing add a square
Joint work with Yair Hayut and Zhixing You. Abstract. Foreman and Magidor showed that the continuum hypothesis implies the existence of a countably-closed $\aleph_2$-cc forcing notion $\mathbb P$ for adding $\square_{\omega_1}$. Here, we show that $\mathbb P$ may consistently be … Continue reading
Posted in Squares and Diamonds
Tagged full tree, Souslin Tree, square principles, super-Souslin tree
Comments Off on More notions of forcing add a square
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 $\kappa$-Souslin trees in a uniform way that does not … Continue reading
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 $\diamondsuit$-based constructions of Souslin trees with various additional properties may be rendered as applications of … Continue reading
Distributive Aronszajn trees
Joint work with Ari Meir Brodsky. Abstract. Ben-David and Shelah proved that if $\lambda$ is a singular strong-limit cardinal and $2^\lambda=\lambda^+$, then $\square^*_\lambda$ entails the existence of a $\lambda$-distributive $\lambda^+$-Aronszajn tree. Here, it is proved that the same conclusion remains … Continue reading
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
