Selective ultrafilters and homogeneity

Annals of Pure and Applied Logic 38 (3):215-255 (1988)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(88)90027-9

Other Versions

No versions found

Links

PhilArchive



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

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

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.
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.
Forcing with filters and complete combinatorics.Claude Laflamme - 1989 - Annals of Pure and Applied Logic 42 (2):125-163.
Cofinal types of ultrafilters.Dilip Raghavan & Stevo Todorcevic - 2012 - Annals of Pure and Applied Logic 163 (3):185-199.
Characterizing existence of certain ultrafilters.Rafał Filipów, Krzysztof Kowitz & Adam Kwela - 2022 - Annals of Pure and Applied Logic 173 (9):103157.
Ultrafilters and types on models of arithmetic.L. A. S. Kirby - 1984 - Annals of Pure and Applied Logic 27 (3):215-252.
HL ideals and Sacks indestructible ultrafilters.David Chodounský, Osvaldo Guzmán & Michael Hrušák - 2024 - Annals of Pure and Applied Logic 175 (1):103326.
On the Mitchell and Rudin-Kiesler orderings of ultrafilters.Moti Gitik - 1988 - Annals of Pure and Applied Logic 39 (2):175-197.
Hierarchies of measure-theoretic ultrafilters.Michael Benedikt - 1999 - Annals of Pure and Applied Logic 97 (1-3):203-219.
Ultrafilters, finite coproducts and locally connected classifying toposes.Richard Garner - 2020 - Annals of Pure and Applied Logic 171 (10):102831.

Analytics

Added to PP
2014-01-16

Downloads
44 (#498,457)

6 months
15 (#195,249)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Forcing with filters and complete combinatorics.Claude Laflamme - 1989 - Annals of Pure and Applied Logic 42 (2):125-163.
Bounding, splitting, and almost disjointness.Jörg Brendle & Dilip Raghavan - 2014 - Annals of Pure and Applied Logic 165 (2):631-651.
Canonical seeds and Prikry trees.Joel Hamkins - 1997 - Journal of Symbolic Logic 62 (2):373-396.
An effective proof that open sets are Ramsey.Jeremy Avigad - 1998 - Archive for Mathematical Logic 37 (4):235-240.
Mathias and set theory.Akihiro Kanamori - 2016 - Mathematical Logic Quarterly 62 (3):278-294.

View all 17 citations / Add more citations

References found in this work

Happy families.A. R. D. Mathias - 1977 - Annals of Mathematical Logic 12 (1):59.
A new proof that analytic sets are Ramsey.Erik Ellentuck - 1974 - Journal of Symbolic Logic 39 (1):163-165.
Ultrafilters on a countable set.David Booth - 1970 - Annals of Mathematical Logic 2 (1):1.
Borel sets and Ramsey's theorem.Fred Galvin & Karel Prikry - 1973 - Journal of Symbolic Logic 38 (2):193-198.
Every analytic set is Ramsey.Jack Silver - 1970 - Journal of Symbolic Logic 35 (1):60-64.

View all 10 references / Add more references