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 [Book Review]

Journal of Symbolic Logic 56 (1):343-344 (1991)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2274936

Links

PhilArchive



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

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

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.
Small Filter forcing.R. Michael Canjar - 1986 - Journal of Symbolic Logic 51 (3):526-546.
Canjar Filters.Osvaldo Guzmán, Michael Hrušák & Arturo Martínez-Celis - 2017 - Notre Dame Journal of Formal Logic 58 (1):79-95.
Cofinalities of countable ultraproducts: the existence theorem.R. Michael Canjar - 1989 - Notre Dame Journal of Formal Logic 30 (4):539-542.
Cofinalities of countable ultraproducts: The existence theorem.Michael Canjar - 1989 - Notre Dame Journal of Formal Logic 30:539-542.
Countable ultraproducts without CH.Michael Canjar - 1988 - Annals of Pure and Applied Logic 37 (1):1-79.
Complete Boolean ultraproducts.R. Michael Canjar - 1987 - Journal of Symbolic Logic 52 (2):530-542.
Andreas Blass. Selective ultrafilters and homogeneity. Annals of pure and applied logic, vol. 38 , pp. 215–255. - Claude Laflamme. Forcing with filters and complete combinatorics. Annals of pure and applied logic, vol. 42 , pp. 125–163. [REVIEW]Peter J. Nyikos - 1991 - Journal of Symbolic Logic 56 (4):1490-1492.
Richard Sommer. Transfinite induction within Peano arithmetic. Annals of pure and applied logic, vol. 76 , pp. 231–289.Michael Rathjen - 1996 - Journal of Symbolic Logic 61 (4):1388.
Moti Gitik and Menachem Magidor. Extender based forcings. The Journal of Symbolic Logic, vol. 59 , pp. 445–460. - Moti Gitik and William J. Mitchell. Indiscernible sequences for extenders, and the singular cardinal hypothesis. Annals of Pure and Applied Logic, vol. 82 , pp. 273–316. - Moti Gitik. Blowing up the power of a singular cardinal. Annals of Pure and Applied Logic, vol. 80 , pp. 17–33. - Moti Gitik and Carmi Merimovich. Possible values for and. Annals of Pure and Applied Logic, vol. 90 , pp. 193–241. - Moti Gitik. Blowing up power of a singular cardinal—wider gaps. Annals of Pure and Applied Logic, vol. 116 , pp. 1–38. [REVIEW]Akihiro Kanamori - 2003 - Bulletin of Symbolic Logic 9 (2):237-241.
Reflection and forcing in E-recursion theory.Theodore A. Slaman - 1985 - Annals of Pure and Applied Logic 29 (1):79-106.
Chris Ash, Julia Knight, Mark Manasse, and Theodore Slaman. Generic copies of countable structures. Annals of pure and applied logic, vol. 42 , pp. 195–205. [REVIEW]Ivan N. Soskov - 1993 - Journal of Symbolic Logic 58 (3):1078-1079.
Jeremy Avigad. Formalizing forcing arguments in subsystems of second-order arithmetic. Annals of pure and applied logic, vol. 82 , pp. 165–191. [REVIEW]Alberto Marcone - 2001 - Bulletin of Symbolic Logic 7 (3):390-391.
Changing cardinal characteristics without changing ω-sequences or cofinalities.Heike Mildenberger & Saharon Shelah - 2000 - Annals of Pure and Applied Logic 106 (1-3):207-261.
Posets of copies of countable scattered linear orders.Miloš S. Kurilić - 2014 - Annals of Pure and Applied Logic 165 (3):895-912.

Analytics

Added to PP
2014-04-06

Downloads
28 (#555,203)

6 months
2 (#1,232,442)

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