Forcing with filters and complete combinatorics

Annals of Pure and Applied Logic 42 (2):125-163 (1989)
  Copy   BIBTEX

Abstract

We study ultrafilters produced by forcing, obtaining different combinatorics and related Rudin-Keisler ordering; in particular we answer a question of Baumgartner and Taylor regarding tensor products of ultrafilters. Adapting a method of Blass and Mathias, we show that in most cases the combinatorics satisfied by the ultrafilters recapture the forcing notion in the Lévy model

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,932

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

Analytics

Added to PP
2014-01-16

Downloads
32 (#487,761)

6 months
7 (#591,670)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Happy families.A. R. D. Mathias - 1977 - Annals of Mathematical Logic 12 (1):59.
Ultrafilters on a countable set.David Booth - 1970 - Annals of Mathematical Logic 2 (1):1.
Selective ultrafilters and homogeneity.Andreas Blass - 1988 - Annals of Pure and Applied Logic 38 (3):215-255.
Some initial segments of the Rudin-Keisler ordering.Andreas Blass - 1981 - Journal of Symbolic Logic 46 (1):147-157.

Add more references