Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.

The Undecidability of a Fundamental Problem in Cluster Set Theory

J. A. Eidswick
Proceedings of the American Mathematical Society
Vol. 60, No. 1 (Oct., 1976), pp. 116-118
DOI: 10.2307/2041123
Stable URL: http://www.jstor.org/stable/2041123
Page Count: 3
  • Read Online (Free)
  • Download ($30.00)
  • Subscribe ($19.50)
  • Cite this Item
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
The Undecidability of a Fundamental Problem in Cluster Set Theory
Preview not available

Abstract

The undecidability of the existence of a nonmetrizable normal picket fence space is established and used to establish the undecidability of the following statement: Any family of approach curves (approaching a point in $\mathbf{R}^2$) along which cluster sets can be arbitrarily preassigned has a nonintersecting truncation.

Page Thumbnails

  • Thumbnail: Page 
116
    116
  • Thumbnail: Page 
117
    117
  • Thumbnail: Page 
118
    118