The unreasonable effectiveness of nonstandard analysis

DOI10.1093/LOGCOM/EXAA019MaRDI QIDQ5108034zbMATH OpenOpenAlexWikidataFDO

Authors Sam Sanders

Publication date 29 April 2020

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1508.07434

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Recommendations

• The computational content of nonstandard analysis
• From nonstandard analysis to various flavours of computability theory
• Reverse formalism 16
• The Gandy-Hyland functional and a computational aspect of nonstandard analysis
• Computability theory, nonstandard analysis, and their connections

Cited in

(8)

• Infinitesimals via Cauchy sequences: refining the classical equivalence
• The strength of compactness in computability theory and nonstandard analysis
• Infinitesimal analysis without the axiom of choice
• From nonstandard analysis to various flavours of computability theory
• The computational content of nonstandard analysis
• Procedures of Leibnizian infinitesimal calculus: an account in three modern frameworks
• Computability theory, nonstandard analysis, and their connections
• Multi-level nonstandard analysis and the axiom of choice

This page was built for publication: The unreasonable effectiveness of nonstandard analysis

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