Skip to main content
Log in

Meeting infinitely many cells of a partition once

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

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}))\).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: 2 October 1996 / Revised version: 22 May 1997

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s001530050110

Navigation