Abstract.
We investigate several versions of a cardinal characteristic \( \frak f\) defined by Frankiewicz. Vojtáš showed \({\frak b} \leq{\frak f}\), and Blass showed \({\frak f} \leq \min({\frak d},{\mbox{\rm unif}}({\bf K}))\). We show that all the versions coincide and that \({\frak f}\) is greater than or equal to the splitting number. We prove the consistency of \(\max({\frak b},{\frak s}) <{\frak f}\) and of \({\frak f} < \min({\frak d},{\mbox{\rm unif}}({\bf K}))\).
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: 2 October 1996 / Revised version: 22 May 1997
Rights and permissions
About this article
Cite this article
Mildenberger, H., Spinas, O. Meeting infinitely many cells of a partition once. Arch Math Logic 37, 495–503 (1998). https://doi.org/10.1007/s001530050110
Issue Date:
DOI: https://doi.org/10.1007/s001530050110