Reflections on Mathematical Economics in the Algorithmic Mode
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.
|Date of creation:||2010|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://www.assru.economia.unitn.it/index.html
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Spear, Stephen E, 1989. "Learning Rational Expectations under Computability Constraints," Econometrica, Econometric Society, vol. 57(4), pages 889-910, July.
When requesting a correction, please mention this item's handle: RePEc:trn:utwpas:1016. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (firstname.lastname@example.org)
If references are entirely missing, you can add them using this form.