1,981 research outputs found
Axiomatics for the external numbers of nonstandard analysis
Neutrices are additive subgroups of a nonstandard model of the real numbers.
An external number is the algebraic sum of a nonstandard real number and a
neutrix. Due to the stability by some shifts, external numbers may be seen as
mathematical models for orders of magnitude. The algebraic properties of
external numbers gave rise to the so-called solids, which are extensions of
ordered fields, having a restricted distributivity law. However, necessary and
sufficient conditions can be given for distributivity to hold. In this article
we develop an axiomatics for the external numbers. The axioms are similar to,
but mostly somewhat weaker than the axioms for the real numbers and deal with
algebraic rules, Dedekind completeness and the Archimedean property. A
structure satisfying these axioms is called a complete arithmetical solid. We
show that the external numbers form a complete arithmetical solid, implying the
consistency of the axioms presented. We also show that the set of precise
elements (elements with minimal magnitude) has a built-in nonstandard model of
the rationals. Indeed the set of precise elements is situated between the
nonstandard rationals and the nonstandard reals whereas the set of non-precise
numbers is completely determined
The computational content of Nonstandard Analysis
Kohlenbach's proof mining program deals with the extraction of effective
information from typically ineffective proofs. Proof mining has its roots in
Kreisel's pioneering work on the so-called unwinding of proofs. The proof
mining of classical mathematics is rather restricted in scope due to the
existence of sentences without computational content which are provable from
the law of excluded middle and which involve only two quantifier alternations.
By contrast, we show that the proof mining of classical Nonstandard Analysis
has a very large scope. In particular, we will observe that this scope includes
any theorem of pure Nonstandard Analysis, where `pure' means that only
nonstandard definitions (and not the epsilon-delta kind) are used. In this
note, we survey results in analysis, computability theory, and Reverse
Mathematics.Comment: In Proceedings CL&C 2016, arXiv:1606.0582
Reverse Mathematics and parameter-free Transfer
Recently, conservative extensions of Peano and Heyting arithmetic in the
spirit of Nelson's axiomatic approach to Nonstandard Analysis, have been
proposed. In this paper, we study the Transfer axiom of Nonstandard Analysis
restricted to formulas without parameters. Based on this axiom, we formulate a
base theory for the Reverse Mathematics of Nonstandard Analysis and prove some
natural reversals, and show that most of these equivalences do not hold in the
absence of parameter-free Transfer.Comment: 22 pages; to appear in Annals of Pure and Applied Logi
- …