Almost-disjoint sets the dense set problem and the partition calculus

Annals of Mathematical Logic 9 (4):401 (1976)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0003-4843(76)90018-8

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,098

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

Almost-disjoint sets the dense set problem and the partition calculus.James E. Baumgartner - 1976 - Annals of Mathematical Logic 9 (4):401-439.
Review: James E. Baumgartner, Bases for Aronszajn Trees; James E. Baumgartner, Polarized Partition Relations and Almost-Disjoint Functions. [REVIEW]Stevo Todorcevic - 2000 - Bulletin of Symbolic Logic 6 (4):497-498.
Partition subalgebras for maximal almost disjoint families.Alan Dow & Jinyuan Zhou - 2002 - Annals of Pure and Applied Logic 117 (1-3):223-259.
James E. Baumgartner. Bases for Aronszajn trees. Tsukuba journal of mathematics, vol. 9 , pp. 31–40. - James E. Baumgartner. Polarized partition relations and almost-disjoint functions. Logic, methodology and philosophy of science VIII, Proceedings of the Eighth International Congress of Logic, Methodology and Philosophy of Science, Moscow, 1987, edited by Jens Erik Fenstad, Ivan T. Frolov, and Risto Hilpinen, Studies in logic and the foundations of mathematics, vol. 126, North-Holland, Amsterdam etc. 1989, pp. 213–222. [REVIEW]Stevo Todorcevic - 2000 - Bulletin of Symbolic Logic 6 (4):497-498.
Towards a Problem of E. van Douwen and A. Miller.Yi Zhang - 1999 - Mathematical Logic Quarterly 45 (2):183-188.
James E. Baumgartner. On the size of closed unbounded sets. Annals of pure and applied logic, vol. 54 , pp. 195–227. [REVIEW]Sy D. Friedman - 2001 - Bulletin of Symbolic Logic 7 (4):538-539.
In memoriam: James Earl Baumgartner (1943–2011).J. A. Larson - 2017 - Archive for Mathematical Logic 56 (7):877-909.
Laver Richard. On the consistency of Borel's conjecture. Acta mathematica, vol. 137 no. 3–4 , pp. 151–169.Baumgartner James E. and Laver Richard. Iterated perfect-set forcing. Annals of mathematical logic, vol. 17 , pp. 271–288. [REVIEW]Arnold W. Miller - 1983 - Journal of Symbolic Logic 48 (3):882-883.
A problem of Laczkovich: How dense are set systems with no large independent sets?Péter Komjáth - 2016 - Annals of Pure and Applied Logic 167 (10):879-896.
Almost Disjoint Families of Representing Sets.Kevin P. Balanda - 1985 - Mathematical Logic Quarterly 31 (1‐6):71-77.

Analytics

Added to PP
2017-02-19

Downloads
4 (#1,644,260)

6 months
1 (#1,516,603)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Perfect-set forcing for uncountable cardinals.Akihiro Kanamori - 1980 - Annals of Mathematical Logic 19 (1-2):97-114.
Remarks on superatomic boolean algebras.James E. Baumgartner & Saharon Shelah - 1987 - Annals of Pure and Applied Logic 33 (C):109-129.
On universal graphs without instances of CH.Saharon Shelah - 1984 - Annals of Pure and Applied Logic 26 (1):75-87.
Higher Miller forcing may collapse cardinals.Heike Mildenberger & Saharon Shelah - 2021 - Journal of Symbolic Logic 86 (4):1721-1744.

View all 19 citations / Add more citations

References found in this work

The fine structure of the constructible hierarchy.R. Björn Jensen - 1972 - Annals of Mathematical Logic 4 (3):229.
Powers of regular cardinals.William B. Easton - 1970 - Annals of Mathematical Logic 1 (2):139.

Add more references