Countable filters on ω

Journal of Symbolic Logic 64 (2):469-478 (1999)
  Copy   BIBTEX

Abstract

Two countable filters on ω are incompatible if they have no common infinite pseudointersection. Letting α(P f ) denote the minimal size of a maximal uncountable family of pairwise incompatible countable filters on ω, we prove the consistency of t $

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,202

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Club guessing sequences and filters.Tetsuya Ishiu - 2005 - Journal of Symbolic Logic 70 (4):1037-1071.
Leibniz filters revisited.Ramon Jansana - 2003 - Studia Logica 75 (3):305 - 317.
Countable unions of simple sets in the core model.P. D. Welch - 1996 - Journal of Symbolic Logic 61 (1):293-312.
End extensions and numbers of countable models.Saharon Shelah - 1978 - Journal of Symbolic Logic 43 (3):550-562.
On automorphism groups of countable structures.Su Gao - 1998 - Journal of Symbolic Logic 63 (3):891-896.
Infinitary combinatorics and modal logic.Andreas Blass - 1990 - Journal of Symbolic Logic 55 (2):761-778.

Analytics

Added to PP
2009-01-28

Downloads
16 (#855,572)

6 months
8 (#292,366)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Partition numbers.Otmar Spinas - 1997 - Annals of Pure and Applied Logic 90 (1-3):243-262.

Add more citations

References found in this work

Partition numbers.Otmar Spinas - 1997 - Annals of Pure and Applied Logic 90 (1-3):243-262.

Add more references