Archives
Keywords
Sierpinski's onto mapping principle Subtle tree property Local Club Condensation. Universal Sequences Singular Density diamond star Commutative cancellative semigroups sap Intersection model Nonspecial tree Fast club Sigma-Prikry Non-saturation Subadditive specializable Souslin tree Fat stationary set Commutative projection system AIM forcing incompactness Diamond-sharp Aronszajn tree OCA ZFC construction weak Kurepa tree Greatly Mahlo very good scale L-space Cardinal function Well-behaved magma S-Space Vanishing levels Club Guessing Subnormal ideal Ascent Path Hedetniemi's conjecture Postprocessing function free Souslin tree PFA weak square regressive Souslin tree Analytic sets Poset Closed coloring Slim tree b-scale Whitehead Problem Coherent tree Rainbow sets Small forcing full tree Strong coloring Uniformization Singular cofinality stationary hitting free Boolean algebra Open Access Knaster and friends square Selective Ultrafilter Reflecting stationary set Countryman line Dushnik-Miller nonmeager set stick Luzin set Dowker space Ineffable cardinal Chang's conjecture countably metacompact Almost Souslin Ostaszewski square Minimal Walks Lipschitz reduction GMA approachability ideal Chromatic number Prikry-type forcing indecomposable ultrafilter Martin's Axiom Uniformly coherent Precaliber xbox super-Souslin tree 54G20 Respecting tree club_AD Axiom R weak diamond Square-Brackets Partition Relations Souslin Tree Kurepa Hypothesis Generalized Clubs transformations Cohen real Microscopic Approach Successor of Singular Cardinal projective Boolean algebra Fodor-type reflection C-sequence Large Cardinals stationary reflection Prevalent singular cardinals strongly bounded groups Weakly compact cardinal Strongly Luzin set Subtle cardinal Shelah's Strong Hypothesis P-Ideal Dichotomy Constructible Universe higher Baire space Erdos-Hajnal graphs HOD square principles Was Ulam right? ccc SNR Iterated forcing Diamond O-space Parameterized proxy principle Strongly compact cardinal Diamond for trees Mandelbrot set Foundations Uniformly homogeneous polarized partition relation unbounded function middle diamond Reduced Power Ramsey theory over partitions Ulam matrix Hindman's Theorem Erdos Cardinal reflection principles Distributive tree Sakurai's Bell inequality Amenable C-sequence positive partition relation Rock n' Roll Singular cardinals combinatorics Forcing Knaster Absoluteness Cardinal Invariants Successor of Regular Cardinal Hereditarily Lindelöf space Almost-disjoint family Rado's conjecture coloring number Forcing Axioms tensor product graph Partition Relations PFA(S)[S] Almost countably chromatic Filter reflection Antichain Generalized descriptive set theory Jonsson cardinal
Tag Archives: Parameterized proxy principle
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
Full Souslin trees at small cardinals
Joint work with Shira Yadai and Zhixing You. Abstract. A
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
Souslin trees at successors of regular cardinals
Abstract. We present a weak sufficient condition for the existence of Souslin trees at successor of regular cardinals. The result is optimal and simultaneously improves an old theorem of Gregory and a more recent theorem of the author. Downloads: Citation … Continue reading
Posted in Publications, Souslin Hypothesis
Tagged Parameterized proxy principle, Souslin Tree
1 Comment
A remark on Schimmerling’s question
Joint work with Ari Meir Brodsky. Abstract. Schimmerling asked whether
Reflection on the coloring and chromatic numbers
Joint work with Chris Lambie-Hanson. Abstract. We prove that reflection of the coloring number of graphs is consistent with non-reflection of the chromatic number. Moreover, it is proved that incompactness for the chromatic number of graphs (with arbitrarily large gaps) … Continue reading
Posted in Compactness, Infinite Graphs, Publications
Tagged 03E35, 05C15, 05C63, Chang's conjecture, Chromatic number, coloring number, Fodor-type reflection, incompactness, Iterated forcing, Parameterized proxy principle, Postprocessing function, Rado's conjecture, square, stationary reflection
2 Comments
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
Forcing and its Applications Retrospective Workshop, April 2015
I gave an invited talk at Forcing and its Applications Retrospective Workshop, Toronto, April 1st, 2015. Title: A microscopic approach to Souslin trees constructions Abstract: We present an approach to construct
Posted in Invited Talks
Tagged Microscopic Approach, Parameterized proxy principle, Souslin Tree
Leave a comment
