Some initial segments of the Rudin-Keisler ordering
Journal of Symbolic Logic 46 (1):147-157 (1981)
Abstract
A 2-affable ultrafilter has only finitely many predecessors in the Rudin-Keisler ordering of isomorphism classes of ultrafilters over the natural numbers. If the continuum hypothesis is true, then there is an ℵ 1 -sequence of ultrafilters D α such that the strict Rudin-Keisler predecessors of D α are precisely the isomorphs of the D β 's for $\betaDOI
10.2307/2273266
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
U-monad topologies of hyperfinite time lines.Renling Jin - 1992 - Journal of Symbolic Logic 57 (2):534-539.
A note on defining the Rudin-Keisler ordering of ultrafilters.Donald H. Pelletier - 1976 - Notre Dame Journal of Formal Logic 17 (2):284-286.
A few special ordinal ultrafilters.Claude Laflamme - 1996 - Journal of Symbolic Logic 61 (3):920-927.
Upward directedness of the Rudin-Keisler ordering of p-points.Claude Laflamme - 1990 - Journal of Symbolic Logic 55 (2):449-456.
Standardization principle of nonstandard universes.Masahiko Murakami - 1999 - Journal of Symbolic Logic 64 (4):1645-1655.
Pκλ combinatorics II: The RK ordering beneath a supercompact measure.William S. Zwicker - 1986 - Journal of Symbolic Logic 51 (3):604 - 616.
Amalgamation of nonstandard models of arithmetic.Andreas Blass - 1977 - Journal of Symbolic Logic 42 (3):372-386.
Local initial segments of the Turing degrees.Bjørn Kjos-Hanssen - 2003 - Bulletin of Symbolic Logic 9 (1):26-36.
The Rudin-Blass ordering of ultrafilters.Claude Laflamme & Jian-Ping Zhu - 1998 - Journal of Symbolic Logic 63 (2):584-592.
Analytics
Added to PP
2009-01-28
Downloads
25 (#465,768)
6 months
1 (#451,398)
2009-01-28
Downloads
25 (#465,768)
6 months
1 (#451,398)
Historical graph of downloads
Citations of this work
Forcing with filters and complete combinatorics.Claude Laflamme - 1989 - Annals of Pure and Applied Logic 42 (2):125-163.
