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