Hostname: page-component-6d856f89d9-4thr5 Total loading time: 0 Render date: 2024-07-16T04:53:00.122Z Has data issue: false hasContentIssue false
  • English
  • Français

Countable filters on ω

Published online by Cambridge University Press:  12 March 2014

Otmar Spinas
Otmar Spinas*
Affiliation:
Mathematik, ETH Zentrum, 8092 Zürich, Switzerland
*
Humboldt-Universitätzu Berlin, Institute für Mathematik, Unter den Linden 6, 10099 Berlin, Germany E-mail: spinas@math.ethz.ch
Get access Rights & Permissions [Opens in a new window]

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
The Journal of Symbolic Logic , Volume 64 , Issue 2 , June 1999 , pp. 469 - 478
Copyright
Copyright © Association for Symbolic Logic 1999

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1] Baumgartner, James and Dordal, Peter, Adjoining dominating functions, this Journal, vol. 50 (1985), pp. 94–101.Google Scholar
[2] Bell, M. G., On the combinatorial principle P(c), Fundamenta Mathematicae, vol. 114 (1981), pp. 149–157.CrossRefGoogle Scholar
[3] Farah, Ilijas, Embedding partially ordered sets into ωω, Fundamenta Mathematicae, vol. 151 (1996), pp. 53–95.Google Scholar
[4] Rothberger, Fritz, On some problems of Hausdorff and of Sierpiński, Fundamenta Mathematicae, vol. 35 (1948), pp. 29–47.CrossRefGoogle Scholar
[5] Spinas, Otmar, Partitioning products of (ω)/fin, Pacific Journal of Mathematics, vol. 176 (1996), no. 1, pp. 249–262.CrossRefGoogle Scholar
[6] Spinas, Otmar, Partition numbers, Annals of Pure and Applied Logic, vol. 90 (1997), pp. 243–262.Google Scholar