n-localization property
Andrzej Roslanowski
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.
Create a lesson
Related papers
On separable pairs of fields and beautiful pairs of separably closed valued fields
Zhengqing He, Martin Hils
Fragments of SRP, the nonstationary ideal, and diagonal reflection
Gunter Fuchs, Hiroshi Sakai
Functional Projection and Complexity Reduction
Vera Fischer, Yurii Khomskii, Yipu Li et al.
On the foundations of logic and probability, II. Modal probability spaces
Loic Cosyns
Linear Logic via algebra I: Girard algebras
Paolo Agliano, Mitar Nedeljkovic
Proper varieties of distributive l-pregroups are periodic
Nikolaos Galatos, Simon Santschi