Constructive Analysis and Nonstandard Analysis are often characterized as completely antipodal approaches to analysis. We discuss the possibility of capturing the central notion of Constructive Analysis (i.e. algorithm, finite procedure or explicit construction) by a simple concept inside Nonstandard Analysis. To this end, we introduce Omega-invariance and argue that it partially satisfies our goal. Our results provide a dual approach to Erik Palmgren's development of Nonstandard Analysis inside constructive mathematics.

The purpose of this paper is to investigate some problems of using finite (or *finite) computational arguments and of the nonstandard notion of an infinitesimal. We will begin by looking at the canonical example illustrating the distinction between classical and constructive analysis, the Intermediate Value Theorem.

Three of Zeno's objections to motion are answered by utilizing a version of nonstandard analysis, internal set theory, interpreted within an empirical context. Two of the objections are without force because they rely upon infinite sets, which always contain nonstandard real numbers. These numbers are devoid of numerical meaning, and thus one cannot render the judgment that an object is, in fact, located at a point in spacetime for which they would serve as coordinates. The third objection, (...) an arrow never appears to be moving, is answered by showing that it only applies to a finite number of instants of time. A theory of motion is also advanced; it consists of a finite series of contiguous infinitesimal steps. The theory is immune to Zeno's first two objections because the number of steps is finite and each lies outside the domain of observation. Present motion is hypothesized to be an unobservable process taking place within each step. The fact of motion is apparent through a summing (Riemann integration) of the steps. (shrink)

We investigate the connections between computability theory and Nonstandard Analysis. In particular, we investigate the two following topics and show that they are intimately related. A basic property of Cantor space$2^ $ is Heine–Borel compactness: for any open covering of $2^ $, there is a finite subcovering. A natural question is: How hard is it to compute such a finite subcovering? We make this precise by analysing the complexity of so-called fan functionals that given any $G:2^ \to $, (...) output a finite sequence $\langle f_0, \ldots,f_n \rangle $ in $2^ $ such that the neighbourhoods defined from $\overline {f_i } G\left$ for $i \le n$ form a covering of $2^ $. A basic property of Cantor space in Nonstandard Analysis is Abraham Robinson’s nonstandard compactness, i.e., that every binary sequence is “infinitely close” to a standard binary sequence. We analyse the strength of this nonstandard compactness property of Cantor space, compared to the other axioms of Nonstandard Analysis and usual mathematics.Our study of yields exotic objects in computability theory, while leads to surprising results in Reverse Mathematics. We stress that and are highly intertwined, i.e., our study is holistic in nature in that results in computability theory yield results in Nonstandard Analysis and vice versa. (shrink)

We develop a constructive version of nonstandard analysis, extending Bishop's constructive analysis with infinitesimal methods. A full transfer principle and a strong idealisation principle are obtained by using a sheaf-theoretic construction due to I. Moerdijk. The construction is, in a precise sense, a reduced power with variable filter structure. We avoid the nonconstructive standard part map by the use of nonstandard hulls. This leads to an infinitesimal analysis which includes nonconstructive theorems such as the Heine-Borel (...) theorem, the Cauchy-Peano existence theorem for ordinary differential equations and the exact intermediate-value theorem, while it at the same time provides constructive results for concrete statements. A nonstandard measure theory which is considerably simpler than that of Bishop and Cheng is developed within this context. (shrink)

In the present paper we introduce a constructive theory of nonstandard arithmetic in higher types. The theory is intended as a framework for developing elementary nonstandard analysis constructively. More specifically, the theory introduced is a conservative extension of HAω + AC. A predicate for distinguishing standard objects is added as in Nelson's internal set theory. Weak transfer and idealisation principles are proved from the axioms. Finally, the use of the theory is illustrated by extending Bishop's constructive (...) class='Hi'>analysis with infinitesimals. (shrink)

This paper reports recent progress in applying nonstandard analysis to additive number theory, especially to problems involving upper Banach density.

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 are used. In this note, we survey results in analysis, computability theory, and Reverse Mathematics. (shrink)

A nonstandard universe is constructed from a superstructure in a Boolean-valued model of set theory. This provides a new framework of nonstandard analysis with which methods of forcing are incorporated naturally. Various new principles in this framework are provided together with the following applications: An example of an 1-saturated Boolean ultrapower of the real number field which is not Scott complete is constructed. Infinitesimal analysis based on the generic extension of the hyperreal numbers is provided, and (...) the hull completeness theorem and the Loeb measure construction are extended to objects in the generic extension of the internal universe. The reduction theory of the Boolean-valued complex numbers are developed as a prototype of the applications to the topological reduction theory of Boolean sheaves or operator algebras. (shrink)

We introduce a nonstandard arithmetic $NQA^-$ based on the theory developed by R. Chuaqui and P. Suppes in [2] (we will denote it by $NQA^+$ ), with a weakened external open minimization schema. A finitary consistency proof for $NQA^-$ formalizable in PRA is presented. We also show interesting facts about the strength of the theories $NQA^-$ and $NQA^+$ ; $NQA^-$ is mutually interpretable with $I\Delta_0 + EXP$ , and on the other hand, $NQA^+$ interprets the theories IΣ1 and $WKL_0$.

Following [3], we build higher-order models of analysis resembling the frameworks of nonstandard analysis. The models are entirely canonical, constructed without Choice. Weak transfer principles are developed and the models are applied to topology, graph theory, and measure theory. A Loeb-like measure is constructed.

Following [3], we build higher-order models of analysis resembling the frameworks of nonstandard analysis. The models are entirely canonical, constructed without Choice. Weak transfer principles are developed and the models are applied to topology, graph theory, and measure theory. A Loeb-like measure is constructed.

We study combinatorial principles related to the isomorphism property and the special model axiom in nonstandard analysis.

A new foundation for constructive nonstandard analysis is presented. It is based on an extension of a sheaf-theoretic model of nonstandard arithmetic due to I. Moerdijk. The model consists of representable sheaves over a site of filter bases. Nonstandard characterisations of various notions from analysis are obtained: modes of convergence, uniform continuity and differentiability, and some topological notions. We also obtain some additional results about the model. As in the classical case, the order type of (...) the nonstandard natural numbers is a dense set of copies of the integers. Every standard set has a hyperfinite enumeration of its standard elements in the model. All arguments are carried out within a constructive and predicative metatheory: Martin-Löf's type theory. (shrink)

In this paper two new combinatorial principles in nonstandard analysis are isolated and applications are given. The second principle provides an equivalent formulation of Henson's isomorphism property.

Let G be a separated (Hausdorff) topological group and let *G be an enlargement of G (see [8]). Thus, *G (i) possesses the same formal properties as G in the sense explained in [8], and (ii) every set of subsets {Aν} of G with the finite intersection property—i.e. such that every nonempty finite subset of {Aν} has a nonempty intersection—satisfies ∩*Aν ≠ ø, where the *Aν are the extensions of the Aν in *G, respectively.

Three results in [14] and one in [8] are analyzed in Sections 3–6 in order to supply examples on Loeb probability spaces, which distinguish the different strength among three generalizations of k-saturation, as well to answer some questions in Section 7 of [15]. In Section 3 we show that not every automorphism of a Loeb algebra is induced by an internal permutation, in Section 4 we show that if the 1-special model axiom is true, then every automorphism of a Loeb (...) algebra is induced by a point-automorphism, in Section 5 we show that not every measure-preserving homomorphism from a small subalgebra to a Loeb algebra is induced by an internal permutation, without assuming full-saturation, in Section 6 we show that, under some cardinality assumptions, the 1-isomorphism property does not guarantee the compactness of a Loeb space, and in Section 7 an application of the 1-special model axiom is given on the existence of ergodic transformations of a Loeb space, which partially answers Problem 2.3 of [5]. (shrink)

I first met Ivor Grattan-Guinness and his wife Enid in the late summer of 1970. I was in England following an intensive course in German at the Goethe Institute in Prien am Chiemsee, and had arrang...

Suppose that fn is a sequence of nonnegative functions with compact support on a locally compact metric space, that T is a nonnegative linear functional, and that equation imageT fn < T f0. A result of Bishop, foundational to a constructive theory of functional analysis, asserts the existence of a point x such that equation imagefn < f0. This paper extends this result to arbitrary Hausdorff spaces, and gives short proofs using nonstandard analysis. While such arguments used (...) are not themselves constructive, they can illuminate where the difficulty lies in finding the point x. An algorithm for constructing x is then given, with a nonstandard proof that the algorithm converges to a correct value. (shrink)

In the fifth version of our response-paper [26] to Imamura’s criticism, we recall that NonStandard Neutrosophic Logic was never used by neutrosophic community in no application, that the quarter of century old neutrosophic operators (1995-1998) criticized by Imamura were never utilized since they were improved shortly after but he omits to tell their development, and that in real world applications we need to convert/approximate the NonStandard Analysis hyperreals, monads and binads to tiny intervals with the desired accuracy (...) – otherwise they would be inapplicable. We point out several errors and false statements by Imamura [21] with respect to the inf/sup of nonstandard subsets, also Imamura’s “rigorous definition of neutrosophic logic” is wrong and the same for his definition of nonstandard unit interval, and we prove that there is not a total order on the set of hyperreals (because of the newly introduced Neutrosophic Hyperreals that are indeterminate), whence the Transfer Principle from R to R* is questionable. After his criticism, several response publications on theoretical nonstandard neutrosophics followed in the period 2018-2022. As such, I extended the NonStandard Analysis by adding the left monad closed to the right, right monad closed to the left, pierced binad (we introduced in 1998), and unpierced binad - all these in order to close the newly extended nonstandard space (R*) under nonstandard addition, nonstandard subtraction, nonstandard multiplication, nonstandard division, and nonstandard power operations [23, 24]. Improved definitions of NonStandard Unit Interval and NonStandard Neutrosophic Logic, together with NonStandard Neutrosophic Operators are presented. (shrink)

A general method of interpreting weak higher-type theories of nonstandard arithmetic in their standard counterparts is presented. In particular, this provides natural nonstandard conservative extensions of primitive recursive arithmetic, elementary recursive arithmetic, and polynomial-time computable arithmetic. A means of formalizing basic real analysis in such theories is sketched.