Abstract
Non-standard analysis can be harnessed by the recursion theorist. But as a computable economist, the conundrums of the Löwenheim-Skolem theorem and the associated Skolem paradox, seem to pose insurmountable epistemological difficulties against the use of algorithmic non-standard analysis. Discontinuities can be tamed by recursive analysis. This particular kind of taming may be a way out of the formidable obstacles created by the difficulties of Diophantine Decision Problems. Methods of existence proofs, used by the "classical" mathematician even if not invoking the axiom of choice cannot be shown to be equivalent to the exhibition of an instance in the sense of a constructive proof. These issues were prompted by the fertile and critical contributions to this special issue.
| Original language | English |
|---|---|
| Pages (from-to) | 139-152 |
| Number of pages | 14 |
| Journal | New Mathematics and Natural Computation |
| Volume | 8 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - Mar 2012 |
| Externally published | Yes |
Keywords
- computability
- Löwenheim-Skolem theorem
- Nonstandard analysis
- Skolem paradox
- Takagi function
Fingerprint
Dive into the research topics of 'Reflections on mathematical economics in the algorithmic mode'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver