2000 character limit reached
Ranks of -limits of filter sequences
Published 2 Oct 2014 in math.LO | (1410.0560v1)
Abstract: We give an exact value of the rank of an -Fubini sum of filters for the case where is a Borel filter of rank $1$. We also consider -limits of filters , which are of the form $\lim</em>\mathcal{F}\mathcal{F}_i=\left{A\subset X: \left{i\in I: A\in\mathcal{F}_i\right}\in\mathcal{F}\right}$. We estimate the ranks of such filters; in particular we prove that they can fall to $1$ for as well as for of arbitrarily large ranks. At the end we prove some facts concerning filters of countable type and their ranks.
Paper Prompts
Sign up for free to create and run prompts on this paper.