Soft-linkedness
Logic
2024-08-08 v3 Combinatorics
Abstract
We have revised the softness property introduced by J\"org Brendle and Haim Judah (perfect sets of random reals. Israel J. Math., 83(1-2):153-176, 1993), to present a new definition of a class of posets called -soft-linked. Our work demonstrates that these posets work well to preserve the evasion number as well as the bounding number small in generic extensions. Furthermore, we establish a connection between our concept and the Fr\'echet-linked notion introduced by Diego A. Mej\'ia (Matrix iterations with vertical support restrictions. In Proceedings of the 14th1 and 15th Asian Logic Conferences, pages 213-248. World Sci. Publ., Hackensack, NJ, 2019).
Cite
@article{arxiv.2402.00144,
title = {Soft-linkedness},
author = {Miguel A. Cardona},
journal= {arXiv preprint arXiv:2402.00144},
year = {2024}
}
Comments
25 pages, 2 figures