Abstract
Two total functionsf, g fromω 1 toω are called strongly almost disjoint if {α<ω 1:f(α)=g(α)} is finite. We show that it is consistent with ZFC to have families of pairwise strongly almost disjoint functions of arbitrary prescribed size.
Similar content being viewed by others
References
J. E. Baumgartner,Almost-disjoint sets, the dense set problem and the partition calculus, Annals of Mathematical Logic9 (1976), 401–439.
T. J. Jech,Set Theory, Academic Press, New York, 1978.
T. J. Jech and S. Shelah,A note on canonical functions, Israel Journal of Mathematics68 (1989), 376–380.
S. Shelah,Proper Forcing, Lecture Notes in Mathematics940, Springer-Verlag, Berlin, 1982.
S. Todorcevic,Partition problems in topology, Contemporary Mathematics84, American Mathematical Society, Providence, R.I., 1989.
S. Todorcevic,Remarks on Martin’s Axiom and the continuum hypothesis, Canadian Journal of Mathematics43 (1991), 832–851.
J. Zapletal,Some results in set theory and Boolean algebras, Ph.D. thesis, The Pennsylvania State University, 1995.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zapletal, J. Strongly almost disjoint functions. Isr. J. Math. 97, 101–111 (1997). https://doi.org/10.1007/BF02774029
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02774029