Splitting Localization and Prediction Numbers

2018/01/30 by Ongay-Valverde, Iván
#FOS: Mathematics #Logic (math.LO)

paper · doi:10.48550/arxiv.1801.09837

Abstract

In this paper the work done by Newelski and Roslanowski is revisited to solve a question done by Blass about one of the possible evasion and prediction numbers. This led to define a variation of the k-localization property (the (k+1)^ω-localization property) and the use of a forcing notion with accelerating trees.

Related

• A Localization Principle for Orbifold Theories
• Perspectives on Stochastic Localization
• Localization game capture time of trees and outerplanar graphs
• The k-visibility Localization Game
• Progress on the localization number of a graph