Cofinalities of countable ultraproducts: the existence theorem

Notre Dame Journal of Formal Logic 30 (4):539-542 (1989)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1305/ndjfl/1093635237

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,045

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Cofinalities of countable ultraproducts: The existence theorem.Michael Canjar - 1989 - Notre Dame Journal of Formal Logic 30:539-542.
Review: Michael Canjar, Countable Ultraproducts Without CH; R. Michael Canjar, Small Filter Forcing. [REVIEW]Arnold W. Miller - 1991 - Journal of Symbolic Logic 56 (1):343-344.
Michael Canjar. Countable ultraproducts without CH. Annals of pure and applied logic, vol. 37 , pp. 1–79. - R. Michael Canjar. Small filter forcing. The journal of symbolic logic, vol. 51 , pp. 526–546. [REVIEW]Arnold W. Miller - 1991 - Journal of Symbolic Logic 56 (1):343-344.
The axiom of choice for countable collections of countable sets does not imply the countable union theorem.Paul E. Howard - 1992 - Notre Dame Journal of Formal Logic 33 (2):236-243.
Constructive ultraproducts and isomorphisms of recursively saturated ultrapowers.G. C. Nelson - 1992 - Notre Dame Journal of Formal Logic 33 (3):433-441.
Variations in definition of ultraproducts of a family of first order relational structures.Wilfred G. Malcolm - 1972 - Notre Dame Journal of Formal Logic 13 (3):394-398.
Some results and algebraic applications in the theory of higher-order ultraproducts.Wilfred G. Malcolm - 1974 - Notre Dame Journal of Formal Logic 15 (1):1-15.
A remark concerning the third theorem about the existence of successors of cardinals.Bolesław Sobociński - 1962 - Notre Dame Journal of Formal Logic 3 (4):279-283.
A stronger theorem concerning the non-existence of combinatorial designs on infinite sets.William J. Frascella - 1973 - Notre Dame Journal of Formal Logic 14 (4):554-558.
End Extensions of Models of Weak Arithmetic Theories.Costas Dimitracopoulos & Vasileios S. Paschalis - 2016 - Notre Dame Journal of Formal Logic 57 (2):181-193.

Analytics

Added to PP
2010-08-24

Downloads
19 (#793,450)

6 months
4 (#1,006,434)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Special ultrafilters and cofinal subsets of $$({}^omega omega, <^*)$$.Peter Nyikos - 2020 - Archive for Mathematical Logic 59 (7-8):1009-1026.
On the cofinality of ultrapowers.Andreas Blass & Heike Mildenberger - 1999 - Journal of Symbolic Logic 64 (2):727-736.
The Rudin-Blass ordering of ultrafilters.Claude Laflamme & Jian-Ping Zhu - 1998 - Journal of Symbolic Logic 63 (2):584-592.
Yet Another Ideal Version of the Bounding Number.Rafał Filipów & Adam Kwela - 2022 - Journal of Symbolic Logic 87 (3):1065-1092.

View all 9 citations / Add more citations

References found in this work

No references found.

Add more references