National Science Library of Georgia

Image from Google Jackets

Chain conditions in topology / W.W. Comfort, S. Negrepontis.

By: Contributor(s): Material type: TextTextSeries: Cambridge tracts in mathematics ; 79.Publisher: Cambridge : Cambridge University Press, 1982Description: 1 online resource (xiii, 300 pages) : digital, PDF file(s)Content type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9780511897337 (ebook)
Subject(s): Additional physical formats: Print version: : No titleDDC classification:
  • 514/.32 19
LOC classification:
  • QA611 .C665 1982
Online resources: Summary: A chain condition is a property, typically involving considerations of cardinality, of the family of open subsets of a topological space. (Sample questions: (a) How large a fmily of pairwise disjoint open sets does the space admit? (b) From an uncountable family of open sets, can one always extract an uncountable subfamily with the finite intersection property. This monograph, which is partly fresh research and partly expository (in the sense that the authors co-ordinate and unify disparate results obtained in several different countries over a period of several decades) is devoted to the systematic use of infinitary combinatorial methods in topology to obtain results concerning chain conditions. The combinatorial tools developed by P. Erdös and the Hungarian school, by Erdös and Rado in the 1960s and by the Soviet mathematician Shanin in the 1940s, are adequate to handle many natural questions concerning chain conditions in product spaces.
Tags from this library: No tags from this library for this title. Log in to add tags.
No physical items for this record

Title from publisher's bibliographic system (viewed on 05 Oct 2015).

A chain condition is a property, typically involving considerations of cardinality, of the family of open subsets of a topological space. (Sample questions: (a) How large a fmily of pairwise disjoint open sets does the space admit? (b) From an uncountable family of open sets, can one always extract an uncountable subfamily with the finite intersection property. This monograph, which is partly fresh research and partly expository (in the sense that the authors co-ordinate and unify disparate results obtained in several different countries over a period of several decades) is devoted to the systematic use of infinitary combinatorial methods in topology to obtain results concerning chain conditions. The combinatorial tools developed by P. Erdös and the Hungarian school, by Erdös and Rado in the 1960s and by the Soviet mathematician Shanin in the 1940s, are adequate to handle many natural questions concerning chain conditions in product spaces.

There are no comments on this title.

to post a comment.
Copyright © 2023 Sciencelib.ge All rights reserved.