There May be Infinitely Many Near-Coherence Classes under u < ∂

Journal of Symbolic Logic 72 (4):1228 - 1238 (2007)
  Copy   BIBTEX

Abstract

We show that in the models of u < ∂ from [14] there are infinitely many near-coherence classes of ultrafilters, thus answering Banakh's and Blass' Question 30 of [3] negatively. By an unpublished result of Canjar, there are at least two classes in these models

Categories

Keywords

Reprint years

DOI

10.2178/jsl/1203350784

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,733

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

On Milliken-Taylor Ultrafilters.Heike Mildenberger - 2011 - Notre Dame Journal of Formal Logic 52 (4):381-394.
Exactly two and exactly three near-coherence classes.Heike Mildenberger - 2023 - Journal of Mathematical Logic 24 (1).
An infinite superstable group has infinitely many conjugacy classes.I. Aguzarov, R. E. Farey & J. B. Goode - 1991 - Journal of Symbolic Logic 56 (2):618-623.
Classes of Barren Extensions.Natasha Dobrinen & Dan Hathaway - 2021 - Journal of Symbolic Logic 86 (1):178-209.
[Omnibus Review].Peter Nyikos - 1992 - Journal of Symbolic Logic 57 (2):763-766.
Andreas Blass. Near coherence of filters, 1: cofinal equivalence of models of arithmetic. Notre Dame journal of formal logic, vol. 27 , pp. 579–591. [REVIEW]H. B. Enderton - 1993 - Journal of Symbolic Logic 58 (1):350.
Theories with a finite number of countable models.Robert E. Woodrow - 1978 - Journal of Symbolic Logic 43 (3):442-455.
Peano Models with Many Generic Classes.James H. Schmerl, M. Lerman, J. H. Schmerl & R. I. Soare - 2009 - Bulletin of Symbolic Logic 15 (2):222-227.
Andreas Blass and Saharon Shelah. Ultrafilters with small generating sets. Israel journal of mathematics, vol. 65 , pp. 259–271. - Andreas Blass and Saharon Shelah. There may be simple - and -points and the Rudin–Keisler ordering may be downward directed. Annals of pure and applied logic, vol. 33 , pp. 213–243. - Andreas Blass. Near coherence of filters. II: Applications to operator ideals, the Stone–Čech remainder of a half-line, order ideals of sequences, and the slenderness of groups. Transactions of the American Mathematical Society, vol. 300 , pp. 557–581. - Andreas Blass and Saharon Shelah. Near coherence of filters III: a simplified consistency proof. Notre Dame journal of formal logic, vol. 30 , pp. 530–538. - Andreas Blass and Claude Laflamme. Consistency results about filters and the number of inequivalent growth types. The journal of symbolic logic, vol. 54 , pp. 50–56. - Andreas Blass. Applications of superperfect forcing and its relatives. Set theory and its applications. [REVIEW]Peter J. Nyikos - 1992 - Journal of Symbolic Logic 57 (2):763-766.
Learning correction grammars.Lorenzo Carlucci, John Case & Sanjay Jain - 2009 - Journal of Symbolic Logic 74 (2):489-516.

Analytics

Added to PP
2010-08-24

Downloads
49 (#442,984)

6 months
4 (#1,237,312)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Near coherence of filters. I. Cofinal equivalence of models of arithmetic.Andreas Blass - 1986 - Notre Dame Journal of Formal Logic 27 (4):579-591.
Near coherence of filters. III. A simplified consistency proof.Andreas Blass & Saharon Shelah - 1989 - Notre Dame Journal of Formal Logic 30 (4):530-538.

Add more references