Switch to: Citations

Add references

You must login to add references.
  1. The Rudin-Blass ordering of ultrafilters.Claude Laflamme & Jian-Ping Zhu - 1998 - Journal of Symbolic Logic 63 (2):584-592.
    We discuss the finite-to-one Rudin-Keisler ordering of ultrafilters on the natural numbers, which we baptize the Rudin-Blass ordering in honour of Professor Andreas Blass who worked extensively in the area. We develop and summarize many of its properties in relation to its bounding and dominating numbers, directedness, and provide applications to continuum theory. In particular, we prove in ZFC alone that there exists an ultrafilter with no Q-point below in the Rudin-Blass ordering.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Models with second order properties V: A general principle.Saharon Shelah, Claude Laflamme & Bradd Hart - 1993 - Annals of Pure and Applied Logic 64 (2):169-194.
    Shelah, S., C. Laflamme and B. Hart, Models with second order properties V: A general principle, Annals of Pure and Applied Logic 64 169–194. We present a general framework for carrying out the construction in [2-10] and others of the same type. The unifying factor is a combinatorial principle which we present in terms of a game in which the first player challenges the second player to carry out constructions which would be much easier in a generic extension of the (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Cofinal types of ultrafilters.Dilip Raghavan & Stevo Todorcevic - 2012 - Annals of Pure and Applied Logic 163 (3):185-199.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Forcing with filters and complete combinatorics.Claude Laflamme - 1989 - Annals of Pure and Applied Logic 42 (2):125-163.
    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.
    Download  
     
    Export citation  
     
    Bookmark   15 citations