Undecidability, incompleteness and Arnol'd problems
From MaRDI portal
Publication:1896752
Cites work
- scientific article; zbMATH DE number 517071 (Why is no real title available?)
- scientific article; zbMATH DE number 1161569 (Why is no real title available?)
- Dynamical system where proving chaos is equivalent to proving Fermat's conjecture
- Gödel incompleteness, explicit expressions for complete arithmetic degrees and applications
- On Canonical Forms and Simplification
- Some undecidable problems involving elementary functions of a real variable
- 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
- Undecidability and incompleteness in classical mechanics
Cited in
(13)- scientific article; zbMATH DE number 3875248 (Why is no real title available?)
- Undecidability in Some Structures Related to Computation Theory
- Undecidability over Continuous Time
- TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE
- scientific article; zbMATH DE number 2123258 (Why is no real title available?)
- scientific article; zbMATH DE number 5497805 (Why is no real title available?)
- Some proofs of undecidability of arithmetic
- Undecidable goals for completed acyclic programs
- scientific article; zbMATH DE number 4031659 (Why is no real title available?)
- Undecidability and intuitionistic incompleteness
- Undecidability in Anti-Realism
- Kalmár and Péter: Undecidability as a Consequence of Incompleteness
- Incompleteness, Undecidability and Automated Proofs
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)
