# Sh:501

• Rosłanowski, A., & Shelah, S. (1996). Localizations of infinite subsets of \omega. Arch. Math. Logic, 35(5-6), 315–339.
• Abstract:
In the present paper we are interested in properties of forcing notions which measure in a sense the distance between the ground model reals and the reals in the extension. We look at the ways the “new” reals can be aproximated by “old” reals. We consider localizations for infinite subsets of \omega. Though each member of [\omega]^\omega can be identified with its increasing enumeration, the (standard) localizations of the enumeration does not provide satisfactory information on successive points of the set. They give us “candidates” for the n-th point of the set but the same candidates can appear several times for distinct n. That led to a suggestion that we should consider disjoint subsets of \omega as sets of “candidates” for successive points of the localized set. We have two possibilities. Either we can demand that each set from the localization contains a limited number of members of the localized set or we can postulate that each intersection of that kind is large. Localizations of this kind are studied in section 1. In the second section we investigate localizations of infinite subsets of \omega by sets of integers from the ground model. These localizations might be thought as localizations by partitions of \omega into successive intervals.
• published version (25p)
Bib entry
@article{Sh:501,
author = {Ros{\l}anowski, Andrzej and Shelah, Saharon},
title = {{Localizations of infinite subsets of $\omega$}},
journal = {Arch. Math. Logic},
fjournal = {Archive for Mathematical Logic},
volume = {35},
number = {5-6},
year = {1996},
pages = {315--339},
issn = {0933-5846},
mrnumber = {1420261},
mrclass = {03E40 (03E05 03E35)},
doi = {10.1007/s001530050048},
note = {\href{https://arxiv.org/abs/math/9506222}{arXiv: math/9506222}},
arxiv_number = {math/9506222}
}