Archives
Keywords
coloring number Uniformly homogeneous Cardinal function Universal Sequences OCA Forcing with side conditions middle diamond free Souslin tree Singular Density Mandelbrot set Almost countably chromatic Singular cardinals combinatorics Whitehead Problem full tree Ascending path Partition Relations Strong coloring positive partition relation diamond star xbox Respecting tree club_AD Open Access Postprocessing function Hedetniemi's conjecture Subtle tree property weak diamond Subadditive square O-space Entangled linear order Generalized descriptive set theory Successor of Singular Cardinal Interval topology on trees Partition relations for trees Monotonically far Coherent tree Club Guessing SNR stationary hitting Diamond-sharp Forcing Distributive tree Rado's conjecture Intersection model Singular cofinality C-sequence Analytic sets approachability ideal Subnormal ideal Non-saturation very good scale Almost Souslin Prikry-type forcing Aronszajn tree Successor of Regular Cardinal P-Ideal Dichotomy Sakurai's Bell inequality Antichain Erdos-Hajnal graphs Reduced Power Slim tree ccc Countryman line Filter reflection PFA Commutative projection system nonmeager set reflection principles Forcing Axioms Diamond Constructible Universe Sierpinski's onto mapping principle perfectly normal Ramsey theory over partitions Knaster and friends Chang's conjecture Closed coloring Ineffable cardinal strongly bounded groups Fast club Minimal Walks sap b-scale Sigma-Prikry countably metacompact Chromatic number Souslin Tree Almost-disjoint family Subtle cardinal Rock n' Roll Jonsson cardinal S-Space regressive Souslin tree Microscopic Approach specializable Souslin tree Luzin set Prevalent singular cardinals Weakly compact cardinal Cardinal Invariants Lipschitz reduction Uniformization transformations Selective Ultrafilter Was Ulam right? Precaliber Large Cardinals Cohen real GMA Parameterized proxy principle Strongly compact cardinal Ascent Path Reflecting stationary set Rainbow sets Erdos Cardinal Ulam matrix stationary reflection L-space free Boolean algebra Martin's Axiom Dushnik-Miller polarized partition relation stick Fodor-type reflection Absoluteness Axiom R Square-Brackets Partition Relations Foundations Well-behaved magma PFA(S)[S] AIM forcing Fat stationary set HOD Dowker space incompactness Diamond for trees Hereditarily Lindelöf space weak Kurepa tree weak square Kurepa Hypothesis Shelah's Strong Hypothesis higher Baire space ZFC construction Small forcing Hindman's Theorem Generalized Clubs 54G20 Uniformly coherent Commutative cancellative semigroups square principles Ostaszewski square Knaster Strongly Luzin set super-Souslin tree Local Club Condensation. Amenable C-sequence indecomposable filter Nonspecial tree Poset Greatly Mahlo tensor product graph Iterated forcing projective Boolean algebra Vanishing levels unbounded function
Tag Archives: free Souslin 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 $\kappa$-Souslin trees in a uniform way that does not … Continue reading
A remark on Schimmerling’s question
Joint work with Ari Meir Brodsky. Abstract. Schimmerling asked whether $\square^*_\lambda$ together with GCH entails the existence of a $\lambda^+$-Souslin tree, for a singular cardinal $\lambda$. Here, we provide an affirmative answer under the additional assumption that there exists a … Continue reading
Reduced powers of Souslin trees
Joint work with Ari Meir Brodsky. Abstract. We study the relationship between a $\kappa$-Souslin tree $T$ and its reduced powers $T^\theta/\mathcal U$. Previous works addressed this problem from the viewpoint of a single power $\theta$, whereas here, tools are developed … Continue reading
