Hostname: page-component-76fb5796d-vfjqv Total loading time: 0 Render date: 2024-04-25T19:54:10.579Z Has data issue: false hasContentIssue false
  • English
  • Français

SLOW P-POINT ULTRAFILTERS

Published online by Cambridge University Press:  26 November 2019

RENLING JIN
RENLING JIN*
Affiliation:
DEPARTMENT OF MATHEMATICS COLLEGE OF CHARLESTON 66 GEORGE STREET CHARLESTON, SC29424, USA E-mail:jinr@cofc.edu
Get access Rights & Permissions [Opens in a new window]

Abstract

We answer a question of Blass, Di Nasso, and Forti [2, 7] by proving, assuming Continuum Hypothesis or Martin’s Axiom, that (1) there exists a P-point which is not interval-to-one and (2) there exists an interval-to-one P-point which is neither quasi-selective nor weakly Ramsey.

Keywords

Primary 03E0503E65slow ultrafilterP-pointinterval-to-one P-pointquasi-selective ultrafilterweakly Ramsey ultrafilter
Type
Articles
Information
The Journal of Symbolic Logic , Volume 85 , Issue 1 , March 2020 , pp. 26 - 36
Copyright
Copyright © The Association for Symbolic Logic 2019 

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

Blass, A., Combinatorial cardinal characteristics of the continuum, Handbook of Set Theory (Foreman, M. and Kanamori, A., editors), Springer-Verlag, Dordrecht, 2010, pp. 395 – 489.CrossRefGoogle Scholar
Blass, A., Di Nasso, M., and Forti, M., Quasi-selective ultrafilters and asymptotic numerosities. Advances in Mathematics, vol. 231 (2012), pp. 1462–1486.CrossRefGoogle Scholar
Booth, D., Ultrafilters on a countable set. Annals of Mathematical Logic, vol. 2 (1970/1971), pp. 1 – 24.CrossRefGoogle Scholar
Di Nasso, M., Fine asymptotic densities for sets of natural numbers. Proceedings of the American Mathematical Society, vol. 138 (2010), pp. 2657–2665.CrossRefGoogle Scholar
Erdős, P., Some remarks on the theory of graphs. Bulletin of the American Mathematical Society, vol. 53 (1947), pp. 292–294.CrossRefGoogle Scholar
Erdős, P. and Szekeres, G., A combinatorial problem in geometry. Compositio Mathematica, vol. 2 (1935), pp. 463–470Google Scholar
Forti, M., Quasi-selective and weakly Ramsey ultrafilters, preprint, 2011, arXiv:1012.4338.Google Scholar
Kunen, K., Set Theory–An Introduction to Independence Proofs, North–Holland, Amsterdam, 1980.Google Scholar
Kunen, K., Set Theory, Mathematical Logic and Foundations, vol. 34, College Publications, London, 2011.Google Scholar
Shelah, S., Proper and Improper Forcing, second ed., Springer-Verlag, Berlin, 1998.CrossRefGoogle Scholar
Spencer, J., Ramsey’s theorem—a new lower bound. Journal of Combinatorial Theory, Series A, vol. 18 (1975), pp. 108–115.CrossRefGoogle Scholar
Vojtáš, P., On ω* and absolutely divergent series. Topology Proceedings, vol. 19 (1994), pp. 335 – 348.Google Scholar