Skip to main content

On Arnol'd's Hilbert symposium problems

  • Contributed Papers
  • Conference paper
  • First Online:
Computational Logic and Proof Theory (KGC 1993)

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

Included in the following conference series:

Abstract

We prove that stability is undecidable for dynamical systems whose right-hand side is explicitly written in the language of elementary analysis.

The results presented here were originally conceived while the second author was visiting the IMSSS at Stanford University as a Senior Fulbright Scholar in 1990. This paper was partially supported by FAPESP and CNPq (Brazil) and JNICT (Portugal). The authors thank their institutions, the Department of Philosophy, University of São Paulo, and the Research Center on Mathematical Theories of Communication, Federal University at Rio de Janeiro, for continuing support of their work.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. V. I. Arnol'd, “Problems of Present Day Mathematics,” XVII (Dynamical systems and differential equations), Proc. Symp. Pure Math. 28, 59 (1976).

    Google Scholar 

  2. V. I. Arnol'd, e-mail message to FAD (1992).

    Google Scholar 

  3. B. F. Caviness, J. of the ACM 17, 385 (1970).

    Google Scholar 

  4. N. C. A. da Costa and F. A. Doria, Int. J. Theor. Phys. 30, 1041 (1991).

    Google Scholar 

  5. N. C. A. da Costa and F. A. Doria, Found. Phys. Letters 4, 363 (1991).

    Google Scholar 

  6. N. C. A. da Costa and F. A. Doria, “Suppes Predicates for Classical Physics,” in J. Echeverría et al., eds., The Space of Mathematics, de Gruyter, Berlin-New York (1992).

    Google Scholar 

  7. N. C. A. da Costa and F. A. Doria, “Structures, Suppes Predicates and Boolean-Valued Models in Physics,” to appear in P. Bystrov and J. Hintikka, eds. Festschrift in Honor of V. I. Smirnov on his 60th Birthday, Kluwer (1992).

    Google Scholar 

  8. N. C. A. da Costa and F. A. Doria, “Suppes Predicates and the Construction of Unsolvable Problems in the Axiomatized Sciences,” in P. Humphreys, ed., Patrick Suppes, Mathematician, Philosopher, Kluwer, (1993).

    Google Scholar 

  9. N. C. A. da Costa, F. A. Doria, J. A. Baêta Segundo, D. Krause, “On Arnol'd's 1974 Hilbert Symposium Problems,” to appear (1993).

    Google Scholar 

  10. M. Davis, “Hilbert's Tenth Problem is Unsolvable,” in Computability and Unsolvability, 2nd. edition, Dover (1982).

    Google Scholar 

  11. D. Richardson, J. Symbol. Logic 33, 514 (1968).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Georg Gottlob Alexander Leitsch Daniele Mundici

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

da Costa, N.C.A., Doria, F.A. (1993). On Arnol'd's Hilbert symposium problems. In: Gottlob, G., Leitsch, A., Mundici, D. (eds) Computational Logic and Proof Theory. KGC 1993. Lecture Notes in Computer Science, vol 713. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022563

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57184-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics