The main results of this work can be formulated in such an elementary way that it is likely to attract mathematicians from a broad spectrum of specialties, though its main audience will likely be combinatorialists, set-theorists, and topologists. The central question is this: Suppose one is given an at most countable family of algebras of subsets of some fixed set such that, for each algebra, there exists at least one set that is not a member of that algebra. Can one then assert that there is a set that is not a member of any of the algebras? Although such a set clearly exists in the case of one or two algebras, it is very easy to construct an example of three algebras for which no such set can be found. Grinblat's principal concern is to determine conditions that, if imposed on the algebras, will insure the existence of a set not belonging to any of them. If the given family is finite, one arrives at a purely combinatorial problem for a finite set of ultrafilters. If the family is countably infinte, however, one needs not only combinatorics of ultrafilters but also set theory and general topology.
ThriftBooks sells millions of used books at the lowest everyday prices. We personally assess every book's quality and offer rare, out-of-print treasures. We deliver the joy of reading in recyclable packaging with free standard shipping on US orders over $15. ThriftBooks.com. Read more. Spend less.