Skip to main content

Admissible Representations of Limit Spaces

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2064))

Abstract

We give a definition of admissible representations for (weak) limit spaces which allows to handle also non topological spaces in the framework of TTE (Type-2 Theory of Effectivity). Limit spaces and weak limit spaces spaces are generalizations of topological spaces. We prove that admissible representations

$$ \delta \mathfrak{X},\delta \mathfrak{Y}, $$

of weak limit spaces

$$ \mathfrak{X},\mathfrak{Y} $$

have the desirable property that every partial function f between them is continuously realizable with respect to

$$ \delta \mathfrak{X},\delta \mathfrak{Y}, $$

iff f is sequentially continuous. Furthermore, we characterize the class of the spaces having an admissible representation. The category of these spaces (equipped with the total sequential continuous functions as morphisms) turns out to be bicartesian-closed. It contains all countably-based T o-spaces. Thus, a reasonable computability theory is possible on important non countably-based topological spaces as well as on non topological spaces.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • 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. G. Birkho: On the combination of topologies, Fundamenta Mathematicae 26, pp. 156–166 (1936)

    Google Scholar 

  2. R.M. Dudley: On Sequential Convergence, Transactions of the American Mathematical Society 112, pp. 483–507 (1964)

    Article  MathSciNet  Google Scholar 

  3. R. Engelking: General Topology, Heldermann, Berlin (1989)

    MATH  Google Scholar 

  4. S.P. Franklin: Spaces in which sequences suffice, Fundamenta Mathematicae 57, pp. 107–115 (1965)

    MATH  MathSciNet  Google Scholar 

  5. A. Grzegorczyk: On the definitions of computable real continuous functions, Fundamenta Mathematicae 44, pp. 61–71 (1957)

    Google Scholar 

  6. J. Kisyński: Convergence du Type L, Colloquium Mathematicum 7, pp. 205–211 (1960)

    MathSciNet  MATH  Google Scholar 

  7. Ker-I Ko: Complexity Theory of Real Functions, Birkhäuser, Boston (1991)

    MATH  Google Scholar 

  8. C. Kreitz and K. Weihrauch: Theory of representations, Theoretical Computer Science 38, pp. 35–53 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  9. K. Kuratowski: Topology, Vol. 1, Academic Press, New York (1966)

    Google Scholar 

  10. M. Menni and A. Simpson: Topological and Limit-space Subcategories of Countably-based Equilogical Spaces, submitted (2000). Available at http://www.dcs.ed.ac.uk/home/als

  11. M. Pour-El and J. Richards: Computability in Analysis and Physics, Springer, Berlin (1989)

    MATH  Google Scholar 

  12. V. Stoltenberg-Hansen and J.V. Tucker: Concrete models of computation for topological algebras, Theoretical Computer Science 219, pp. 347–378 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  13. P. Urysohn: Sur les classes L de M. Fréchet, Enseignement Mathématique 25, pp. 77–83 (1926)

    Google Scholar 

  14. K. Weihrauch: Computability, Springer, Berlin (1987)

    MATH  Google Scholar 

  15. K. Weihrauch: A Foundation for Computable Analysis, EATCS Bulletin Nr. 57, pp. 167–182 (October 1995)

    MATH  Google Scholar 

  16. K. Weihrauch: A Foundation for Computable Analysis, in: Proceedings of DMTCS’ 96 (Discrete Mathematics and Theoretical Computer Science), Springer, Berlin pp. 66–89 (1997)

    Google Scholar 

  17. K. Weihrauch: Computable Analysis, Springer, Berlin (2000)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schröder, M. (2001). Admissible Representations of Limit Spaces. In: Blanck, J., Brattka, V., Hertling, P. (eds) Computability and Complexity in Analysis. CCA 2000. Lecture Notes in Computer Science, vol 2064. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45335-0_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-45335-0_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42197-9

  • Online ISBN: 978-3-540-45335-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics