Undecidability, incompleteness and Arnol'd problems

Studia Logica 55 (1):23-32 (1995)
  Copy   BIBTEX

Abstract

We present some recent technical results of us on the incompleteness of classical analysis and then discuss our work on the Arnol'd decision problems for the stability of fixed points of dynamical systems

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,783

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

The incompleteness of theories of games.Marcelo Tsuji, Newton C. A. Costa & Francisco A. Doria - 1998 - Journal of Philosophical Logic 27 (6):553-568.
Recursion theory for metamathematics.Raymond Merrill Smullyan - 1993 - New York: Oxford University Press.
Undecidable theories.Alfred Tarski - 1953 - Amsterdam,: North-Holland Pub. Co.. Edited by Andrzej Mostowski & Raphael M. Robinson.
Alan Turing and the mathematical objection.Gualtiero Piccinini - 2003 - Minds and Machines 13 (1):23-48.
Gödel's incompleteness theorems.Raymond M. Smullyan - 1992 - New York: Oxford University Press. Edited by Lou Goble.
Gödel's incompleteness theorems and computer science.Roman Murawski - 1997 - Foundations of Science 2 (1):123-135.

Analytics

Added to PP
2013-01-22

Downloads
15 (#944,758)

6 months
4 (#783,478)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations