n-localization property
classification
🧮 math.LO
keywords
n-localizationpropertytreeeveryn-aryomegacountableextension
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.