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: 92,923

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.
omnibus Review. [REVIEW]James Baumgartner - 1995 - Journal of Symbolic Logic 60 (2):698-701.
[Omnibus Review].James E. Baumgartner - 1985 - Journal of Symbolic Logic 50 (1):239-240.
On the Consistency of Some Partition Theorems for Continuous Colorings, and the Structure of ℵ 1 -Dense Real Order Types.J. Steprans, Uri Abraham, Matatyahu Rubin & Saharon Shelah - 2002 - Bulletin of Symbolic Logic 8 (2):303.
On the consistency of some partition theorems for continuous colorings, and the structure of ℵ1-dense real order types.Uri Abraham, Matatyahu Rubin & Saharon Shelah - 1985 - Annals of Pure and Applied Logic 29 (2):123-206.
Density and Baire category in recursive topology.Iraj Kalantari & Larry Welch - 2004 - Mathematical Logic Quarterly 50 (4-5):381-391.
Towards a Problem of E. van Douwen and A. Miller.Yi Zhang - 1999 - Mathematical Logic Quarterly 45 (2):183-188.
Pairwise disjoint eight-shaped curves in hybrid planes.Camillo Costantini - 2007 - Mathematical Logic Quarterly 53 (6):551-557.
Recursive constructions in topological spaces.Iraj Kalantari & Allen Retzlaff - 1979 - Journal of Symbolic Logic 44 (4):609-625.
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.
A special class of almost disjoint families.Thomas E. Leathrum - 1995 - Journal of Symbolic Logic 60 (3):879-891.
The spectrum of partitions of a Boolean algebra.J. Donald Monk - 2001 - Archive for Mathematical Logic 40 (4):243-254.
The algebraic structure of the isomorphic types of tally, polynomial time computable sets.Yongge Wang - 2002 - Archive for Mathematical Logic 41 (3):215-244.
Calculus on strong partition cardinals.James M. Henle - 2006 - Mathematical Logic Quarterly 52 (6):585-594.
Partition subalgebras for maximal almost disjoint families.Alan Dow & Jinyuan Zhou - 2002 - Annals of Pure and Applied Logic 117 (1-3):223-259.

Analytics

Added to PP
2017-02-19

Downloads
4 (#1,640,364)

6 months
1 (#1,511,647)

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.
Separating families and order dimension of Turing degrees.Ashutosh Kumar & Dilip Raghavan - 2021 - Annals of Pure and Applied Logic 172 (5):102911.

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