Article contents
Countable filters on ω
Published online by Cambridge University Press: 12 March 2014
Abstract
Two countable filters on ω are incompatible if they have no common infinite pseudointersection. Letting (Pf) denote the minimal size of a maximal uncountable family of pairwise incompatible countable filters on ω, we prove the consistency of t < a(Pf).
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1999
References
REFERENCES
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20181211093726775-0083:S0022481200013414:S0022481200013414_inline2.gif?pub-status=live)
- 1
- Cited by