Undecidability, incompleteness and Arnol'd problems
From MaRDI portal
Publication:1896752
DOI10.1007/BF01053030zbMATH Open0840.03031MaRDI QIDQ1896752FDOQ1896752
Authors: Francisco Antonio Doria, N. C. A. da Costa 
Publication date: 11 September 1995
Published in: Studia Logica (Search for Journal in Brave)
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Stability theory for smooth dynamical systems (37C75) Undecidability and degrees of sets of sentences (03D35)
Cites Work
- The Hopf bifurcation and its applications. With contributions by P. Chernoff, G. Childs, S. Chow, J. R. Dorroh, J. Guckenheimer, L. Howard, N. Kopell, O. Lanford, J. Mallet-Paret, G. Oster, O. Ruiz, S. Schecter, D. Schmidt, and S. Smale
- Some undecidable problems involving elementary functions of a real variable
- Gödel incompleteness, explicit expressions for complete arithmetic degrees and applications
- Undecidability and incompleteness in classical mechanics
- On Canonical Forms and Simplification
- Title not available (Why is that?)
- Dynamical system where proving chaos is equivalent to proving Fermat's conjecture
- Title not available (Why is that?)
Cited In (13)
- Some proofs of undecidability of arithmetic
- Title not available (Why is that?)
- Undecidability in Some Structures Related to Computation Theory
- Title not available (Why is that?)
- TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE
- Undecidability and intuitionistic incompleteness
- Undecidable goals for completed acyclic programs
- Title not available (Why is that?)
- Incompleteness, Undecidability and Automated Proofs
- Title not available (Why is that?)
- Undecidability over Continuous Time
- Kalmár and Péter: Undecidability as a Consequence of Incompleteness
- Undecidability in Anti-Realism
This page was built for publication: Undecidability, incompleteness and Arnol'd problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1896752)
