27 citations · 138 across the 42 of their papers we have counts for
Showing 2016 · math.LOShow all
3 papers · 2 filters
math.LO2016★ 7 cited
Strong failures of higher analogs of Hindman's theorem
David Fernández-Bretón, Assaf Rinot
We show that various analogs of Hindman's Theorem fail in a strong sense when one attempts to obtain uncountable monochromatic sets: Theorem 1: There exists a colouring $c:\mathbb…
math.LO2016★ 8 cited
More notions of forcing add a Souslin tree
Ari Meir Brodsky, Assaf Rinot
An -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…
math.LO2016★ 22 cited
A Microscopic approach to Souslin-tree constructions. Part I
Ari Meir Brodsky, Assaf Rinot
We propose a parameterized proxy principle from which -Souslin trees with various additional features can be constructed, regardless of the identity of . We then introduce th…