Rudin-Keisler Posets of Complete Boolean Algebras

Mathematical Logic Quarterly 47 (4):447-454 (2001)
  Copy   BIBTEX


The Rudin-Keisler ordering of ultrafilters is extended to complete Boolean algebras and characterised in terms of elementary embeddings of Boolean ultrapowers. The result is applied to show that the Rudin-Keisler poset of some atomless complete Boolean algebras is nontrivial



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

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

Some initial segments of the Rudin-Keisler ordering.Andreas Blass - 1981 - Journal of Symbolic Logic 46 (1):147-157.
Standardization principle of nonstandard universes.Masahiko Murakami - 1999 - Journal of Symbolic Logic 64 (4):1645-1655.
The Rudin-Blass ordering of ultrafilters.Claude Laflamme & Jian-Ping Zhu - 1998 - Journal of Symbolic Logic 63 (2):584-592.
Minimum‐sized Infinite Partitions of Boolean Algebras.J. Donald Monk - 1996 - Mathematical Logic Quarterly 42 (1):537-550.
Elementary embedding between countable Boolean algebras.Robert Bonnet & Matatyahu Rubin - 1991 - Journal of Symbolic Logic 56 (4):1212-1229.
Hyper-Archimedean BL-algebras are MV-algebras.Esko Turunen - 2007 - Mathematical Logic Quarterly 53 (2):170-175.
Boolean deductive systems of BL-algebras.Esko Turunen - 2001 - Archive for Mathematical Logic 40 (6):467-473.
A note on defining the Rudin-Keisler ordering of ultrafilters.Donald H. Pelletier - 1976 - Notre Dame Journal of Formal Logic 17 (2):284-286.
Some Boolean Algebras with Finitely Many Distinguished Ideals I.Regina Aragón - 1995 - Mathematical Logic Quarterly 41 (4):485-504.


Added to PP

14 (#873,032)

6 months
1 (#1,149,473)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references