Splitting Localization and Prediction Numbers

MaRDI QIDQ6297096zbMATH OpenFDO

Authors Iván Ongay-Valverde

Publication date 29 January 2018

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{)}^{omega}$-localization property) and the use of a forcing notion with accelerating trees.

This page was built for publication: Splitting Localization and Prediction Numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6297096)