n-localization property
Logic
2013-01-04 v1
Abstract
Let n be an integer greater than 1. A tree T is an n-ary tree provided that every node in T has at most n immediate successors. A forcing notion P has the n-localization property if every function from omega to omega in an extension via P is an omega-branch in an n-ary tree from the ground model. In the present paper we are interested in getting the n-localization property for countable support iterations.
Keywords
Cite
@article{arxiv.math/0507519,
title = {n-localization property},
author = {Andrzej Roslanowski},
journal= {arXiv preprint arXiv:math/0507519},
year = {2013}
}