Skip to main content

Finitely approximable sets

  • 311 Accesses

Part of the Lecture Notes in Mathematics book series (LNM,volume 1104)

Abstract

The continuous or countable functionals form a class of objects which are finitely approximable — they can be completely described by a set of (hereditarily) finite sets (approximations). We introduce and study a wider class of objects — sets, functions, and relations — all of which lay claim to a notion of finite approximability.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   44.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   59.00
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dugundji, J., Topology, Allyn and Bacon, Boston, 1966, xvi + 447 pp.

    MATH  Google Scholar 

  2. Hinman, P.G., Recursion-Theoretic Hierarchies, Perspectives in Mathematical Logic, Springer-Verlag, Berlin-Heidelberg-New York, 1978, xii + 480 pp.

    CrossRef  MATH  Google Scholar 

  3. Hyland, J.M.E., Filter spaces and continuous functionals, Annals of Mathematical Logic 16 (1979) 101–143.

    CrossRef  MathSciNet  MATH  Google Scholar 

  4. Kechris, A.S. and Moschovakis, Y.N., Recursion in higher types, Handbook of Mathematical Logic, ed. K.J. Barwise, North-Holland, Amsterdam, 1977, 681–737.

    CrossRef  Google Scholar 

  5. Kleene, S.C., Countable functionals, Constructivity in Mathematics, ed. A. Heyting. North-Holland, Amsterdam, 1959, 81–100.

    Google Scholar 

  6. Kreisel, G., Interpretation of analysis by means of functionals of finite type, Constructivity in Mathematics, ed. A. Heyting, North-Holland, Amsterdam, 1959, 101–128.

    Google Scholar 

  7. Normann, D., Set recursion, Generalized Recursion Theory II, ed. J.E. Fenstad, R.O. Gandy, and G.E. Sacks, North-Holland, Amsterdam, 1978, 303–320.

    Google Scholar 

  8. Normann, D., Recursion on the countable functionals, Lecture Notes in Mathematics 811, Springer-Verlag, Berlin-Heidelberg-New York, 1980, viii + 191 pp.

    CrossRef  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1984 Springer-Verlag

About this paper

Cite this paper

Hinman, P.G. (1984). Finitely approximable sets. In: Börger, E., Oberschelp, W., Richter, M.M., Schinzel, B., Thomas, W. (eds) Computation and Proof Theory. Lecture Notes in Mathematics, vol 1104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0099488

Download citation

  • DOI: https://doi.org/10.1007/BFb0099488

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13901-0

  • Online ISBN: 978-3-540-39119-7

  • eBook Packages: Springer Book Archive