3 papers
math.LO2026
The power of trees
Ari Meir Brodsky, Assaf Rinot, Shira Yadai
We give two consistent constructions of trees whose finite power is sharply different from : 1. An -tree whose interval topology is perfectly…
math.LO2025
Proxy principles in combinatorial set theory
Ari Meir Brodsky, Assaf Rinot, Shira Yadai
The parameterized proxy principles were introduced by Brodsky and Rinot in a 2017 paper, as new foundations for the construction of -Souslin trees in a uniform way that does no…
math.LO2024
Full Souslin trees at small cardinals
Assaf Rinot, Shira Yadai, Zhixing You
A -tree is said to be full if each of its limit levels omits no more than one potential branch. Kunen asked whether a full -Souslin tree may consistently exist. Shelah gave…