Tag Archives: Parameterized proxy principle

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 , , , , , , , , , , , , | 2 Comments

More notions of forcing add a Souslin tree

Joint work with Ari Meir Brodsky. Abstract.   An $\aleph_1$-Souslin tree is a complicated combinatorial object whose existence cannot be decided on the grounds of ZFC alone. But 15 years after Tennenbaum and independently Jech devised notions of forcing for introducing … Continue reading

Posted in Preprints, Souslin Hypothesis | Tagged , , , , | 1 Comment

A Microscopic approach to Souslin-tree constructions. Part I

Joint work with Ari Meir Brodsky. Abstract.  We propose a parameterized proxy principle from which $\kappa$-Souslin trees with various additional features can be constructed, regardless of the identity of $\kappa$. We then introduce the microscopic approach, which is a simple … Continue reading

Posted in Publications, Souslin Hypothesis | Tagged , , , , , , , , , , , | 4 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 $\kappa$-Souslin trees that is insensitive to the identity of … Continue reading

Posted in Invited Talks | Tagged , , | Leave a comment