Algorithm and proof as -invariance and transfer: a new model of computation in nonstandard analysis

MaRDI QIDQ4994846zbMATH OpenFDO

Authors Sam Sanders

Publication date 22 June 2021

Full work available at URL https://arxiv.org/abs/1404.0080, http://eptcs.web.cse.unsw.edu.au/paper.cgi?DCM2012.9

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Turing machines and related notions (03D10) Constructive and recursive analysis (03F60) Nonstandard models in mathematics (03H05)

Abstract: We propose a new model of computation based on nonstandard analysis. Intuitively, the role of "algorithm" is played by a new notion of finite procedure, called Omega-invariance and inspired by physics, from nonstandard analysis. Moreover, the role of 'proof' is taken up by the Transfer Principle from nonstandard analysis. We obtain a number of results in Constructive Reverse Mathematics to illustrate the tight correspondence to Errett Bishop's Constructive Analysis and the associated Constructive Reverse Mathematics.

Recommendations

• scientific article; zbMATH DE number 3979058
• On the connection between nonstandard analysis and constructive analysis
• From nonstandard analysis to various flavours of computability theory
• The Gandy-Hyland functional and a computational aspect of nonstandard analysis
• The computational content of nonstandard analysis

Cited in

(5)

• Proofs and retributions, or: why Sarah can't take limits
• ERNA and Friedman's Reverse Mathematics
• Saturation and Σ₂-transfer for ERNA
• scientific article; zbMATH DE number 3979058 (Why is no real title available?)
• The Gandy-Hyland functional and a computational aspect of nonstandard analysis

This page was built for publication: Algorithm and proof as \(\Omega\)-invariance and transfer: a new model of computation in nonstandard analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4994846)