Hostname: page-component-76fb5796d-5g6vh Total loading time: 0 Render date: 2024-04-27T05:36:02.067Z Has data issue: false hasContentIssue false
  • English
  • Français

A few special ordinal ultrafilters

Published online by Cambridge University Press:  12 March 2014

Claude Laflamme
Claude Laflamme*
Affiliation:
Department of Mathematics and Statistics, University of Calgary, Calgary, Alberta, CanadaT2N 1N4, E-mail: laflamme@acs.ucalgary.ca
Get access Rights & Permissions [Opens in a new window]

Abstract

We prove various results on the notion of ordinal ultrafiters introduced by J. Baumgartner. In particular, we show that this notion of ultrafilter complexity is independent of the more familiar Rudin-Keisler ordering.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 61 , Issue 3 , September 1996 , pp. 920 - 927
Copyright
Copyright © Association for Symbolic Logic 1996

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Baumgartner, J., Ultrafilters on ω, this Journal, vol. 60 (1995), pp. 624–639.Google Scholar
[2]Booth, D., Ultrafilters on a countable set, Annals of Mathematical Logic, vol. 2 (1970), pp. 1–24.CrossRefGoogle Scholar
[3]Kunen, K., Set theory: An introduction to independence proofs, North Holland, Amsterdam, 1980.Google Scholar
[4]Laflamme, C., Forcing with filters and complete combinatorics, Annals of Pure and Applied Logic, vol. 42 (1989), pp. 125–163.CrossRefGoogle Scholar