We consider notions of boundedness of subsets of the natural numbers ℕ that occur when doing mathematics in the context of intuitionistic logic. We obtain a new characterization of the notion of a pseudobounded subset and we formulate the closely related notion of a detachably finite subset. We establish metric equivalents for a subset of ℕ to be detachably finite and to satisfy the ascending chain condition. Following Ishihara, we spell out the relationship between detachable finiteness and sequential continuity. Most (...) of the results do not require countable choice. (shrink)

The glueing of (sequentially, pointwise, or uniformly) continuous functions that coincide on the intersection of their closed domains is examined in the light of Bishop-style constructive analysis. This requires us to pay attention to the way that the two domains intersect.

There are two principles that lend Brouwer's mathematics the extra power beyond arithmetic. Both are presented in Brouwer's writings with little or no argument. One, the principle of bar induction, will not concern us here. The other, the continuity principle for numbers, occurs for the first time in print in [4]. It is formulated and immediately applied to show that the set of numerical choice sequences is not enumerable. In fact, the idea of the continuity property can be dated fairly (...) precisely, it is to be found in the margin of Brouwer's notes for his course on Pointset Theory of 1915/16. The course was repeated in 1916/17 and he must have inserted his first formulation of the continuity principle in the fall of 1916 as new material right at the beginning of the course.In modern language, the principle readswhere α and β range over choice sequences of natural numbers,mandxover natural numbers, andstands for ⟨α(0), α(1), …, α(m− 1)⟩, the initial segment of α of lengthm.An immediate consequence of WC-N is that all full functions are continuous, and, as a corollary, that the continuum is unsplittable [28]. Note that WC-N is incompatible with Church's thesis, [22], section 4.6.After Brouwer asserted WC-N, Troelstra was the first to ask in print for a conceptual motivation, but he remained an exception; most authors followed Brouwer by simply asserting it, cf. [18].Let us note first that in one particular case the principle is obvious indeed, namely in the case of the lawless sequences. The notion of lawless sequence surfaced fairly late in the history of intuitionism. Kreisel introduced it in [17] for metamathematical purposes. There is a letter from Brouwer to Heyting in which the phenomenon also occurs [7]. This is an important and interesting fact since it is (probably) the only time that Brouwer made use of a possibility expressly stipulated in, e.g., [5], see below. (shrink)

There are two principles that lend Brouwer's mathematics the extra power beyond arithmetic. Both are presented in Brouwer's writings with little or no argument. One, the principle of bar induction, will not concern us here. The other, the continuity principle for numbers, occurs for the first time in print in [4]. It is formulated and immediately applied to show that the set of numerical choice sequences is not enumerable. In fact, the idea of the continuity property can be dated fairly (...) precisely, it is to be found in the margin of Brouwer's notes for his course on Pointset Theory of 1915/16. The course was repeated in 1916/17 and he must have inserted his first formulation of the continuity principle in the fall of 1916 as new material right at the beginning of the course.In modern language, the principle readswhere α and β range over choice sequences of natural numbers, m and x over natural numbers, and stands for ⟨α, α, …, α⟩, the initial segment of α of length m.An immediate consequence of WC-N is that all full functions are continuous, and, as a corollary, that the continuum is unsplittable [28]. Note that WC-N is incompatible with Church's thesis, [22], section 4.6.After Brouwer asserted WC-N, Troelstra was the first to ask in print for a conceptual motivation, but he remained an exception; most authors followed Brouwer by simply asserting it, cf. [18].Let us note first that in one particular case the principle is obvious indeed, namely in the case of the lawless sequences. The notion of lawless sequence surfaced fairly late in the history of intuitionism. Kreisel introduced it in [17] for metamathematical purposes. There is a letter from Brouwer to Heyting in which the phenomenon also occurs [7]. This is an important and interesting fact since it is the only time that Brouwer made use of a possibility expressly stipulated in, e.g., [5], see below. (shrink)

There are two principles that lend Brouwer's mathematics the extra power beyond arithmetic. Both are presented in Brouwer's writings with little or no argument. One, the principle of bar induction, will not concern us here. The other, the continuity principle for numbers, occurs for the first time in print in [4]. It is formulated and immediately applied to show that the set of numerical choice sequences is not enumerable. In fact, the idea of the continuity property can be dated fairly (...) precisely, it is to be found in the margin of Brouwer's notes for his course on Pointset Theory of 1915/16. The course was repeated in 1916/17 and he must have inserted his first formulation of the continuity principle in the fall of 1916 as new material right at the beginning of the course.In modern language, the principle readswhere α and β range over choice sequences of natural numbers, m and x over natural numbers, and stands for ⟨α, α, …, α⟩, the initial segment of α of length m.An immediate consequence of WC-N is that all full functions are continuous, and, as a corollary, that the continuum is unsplittable [28]. Note that WC-N is incompatible with Church's thesis, [22], section 4.6.After Brouwer asserted WC-N, Troelstra was the first to ask in print for a conceptual motivation, but he remained an exception; most authors followed Brouwer by simply asserting it, cf. [18].Let us note first that in one particular case the principle is obvious indeed, namely in the case of the lawless sequences. The notion of lawless sequence surfaced fairly late in the history of intuitionism. Kreisel introduced it in [17] for metamathematical purposes. There is a letter from Brouwer to Heyting in which the phenomenon also occurs [7]. This is an important and interesting fact since it is the only time that Brouwer made use of a possibility expressly stipulated in, e.g., [5], see below. (shrink)

Uniform sequential continuity, a property classically equivalent to sequential continuity on compact sets, is shown, constructively, to be a consequence of strong continuity on a metric space. It is then shown that in the case of a separable metric space, uniform sequential continuity implies strong continuity if and only if one adopts a certain boundedness principle that, although valid in the classical, recursive and intuitionistic setting, is independent of Heyting arithmetic.

We prove the Banach‐Steinhaus theorem for distributions on the space ????(ℝ) within Bishop's constructive mathematics. To this end, we investigate the constructive sequential completion $ \tilde {\cal D} $(ℝ) of ????(ℝ).

It is folklore that if a continuous function on a complete metric space has approximate roots and in a uniform manner at most one root, then it actually has a root, which of course is uniquely determined. Also in Bishop's constructive mathematics with countable choice, the general setting of the present note, there is a simple method to validate this heuristic principle. The unique solution even becomes a continuous function in the parameters by a mild modification of the uniqueness hypothesis. (...) Moreover, Brouwer's fan theorem for decidable bars turns out to be equivalent to the statement that, for uniformly continuous functions on a compact metric space, the crucial uniform “at most one” condition follows from its non-uniform counterpart. This classification in the spirit of the constructive reverse mathematics, as propagated by Ishihara and others, sharpens an earlier result obtained jointly with Berger and Bridges. (shrink)

Ishiharaʼs boundedness principleBD-N was introduced in Ishihara [5] and has turned out to be most useful for constructive analysis, see e.g. Ishihara [6]. It is equivalent to the statement that every sequentially continuous function from NN to N is continuous w.r.t. the usual metric topology on NN. We construct models for higher order arithmetic and intuitionistic set theory in which both every function from NN to N is sequentially continuous and in which the axiom of choice from NN to N (...) holds. Since the latter is known to be inconsistent with the statement that all functions from NN to N are continuous these models refute BD-N. (shrink)

In the context of constructive reverse mathematics, we show that weak Kőnig's lemma () implies that every pointwise continuous function is induced by a code in the sense of reverse mathematics. This, combined with the fact that implies the Fan theorem, shows that implies the uniform continuity theorem: every pointwise continuous function has a modulus of uniform continuity. Our results are obtained in Heyting arithmetic in all finite types with quantifier‐free axiom of choice.

The anti-Specker property, a constructive version of sequential compactness, is used to prove constructively that a pointwise continuous, order-dense preference relation on a compact metric space is uniformly sequentially continuous. It is then shown that Ishihara's principle BD-ℕ implies that a uniformly sequentially continuous, order-dense preference relation on a separable metric space is uniformly continuous. Converses of these two theorems are also proved.

Working within Bishop-style constructive mathematics, we examine some of the consequences of the anti-Specker property, known to be equivalent to a version of Brouwer's fan theorem. The work is a contribution to constructive reverse mathematics.

Various types of continuity for preference relations on a metric space are examined constructively. In particular, necessary and sufficient conditions are given for an order-dense, strongly extensional preference relation on a complete metric space to be continuous. It is also shown, in the spirit of constructive reverse mathematics, that the continuity of sequentially continuous, order-dense preference relations on complete, separable metric spaces is connected to Ishihara's principleBD-ℕ, and therefore is not provable within Bishop-style constructive mathematics alone.

The notions of permutable and weak-permutable convergence of a series|$\sum _{n=1}^{\infty }a_{n}$|of real numbers are introduced. Classically, these two notions are equivalent, and, by Riemann’s two main theorems on the convergence of series, a convergent series is permutably convergent if and only if it is absolutely convergent. Working within Bishop-style constructive mathematics, we prove that Ishihara’s principle BD-|$\mathbb {N}$|implies that every permutably convergent series is absolutely convergent. Since there are models of constructive mathematics in which the Riemann permutation theorem for (...) series holds but BD-|$\mathbb{N}$|does not, the best we can hope for as a partial converse to our first theorem is that the absolute convergence of series with a permutability property classically equivalent to that of Riemann implies BD-|$\mathbb {N}$|. We show that this is the case when the property is weak-permutable convergence. (shrink)

In the informal setting of Bishop-style constructive reverse mathematics we discuss the connection between the antithesis of Specker’s theorem, Ishihara’s principle BD-N, and various types of equicontinuity. In particular, we prove that the implication from pointwise equicontinuity to uniform sequential equicontinuity is equivalent to the antithesis of Specker’s theorem; and that, for a family of functions on a separable metric space, the implication from uniform sequential equicontinuity to uniform equicontinuity is equivalent to BD-N.