We present a survey of the recent applications of continuous domains for providing simple computational models for classical spaces in mathematics including the real line, countably based locally compact spaces, complete separable metric spaces, separable Banach spaces and spaces of probability distributions. It is shown how these models have a logical and effective presentation and how they are used to give a computational framework in several areas in mathematics and physics. These include fractal geometry, where new results on existence and (...) uniqueness of attractors and invariant distributions have been obtained, measure and integration theory, where a generalization of the Riemann theory of integration has been developed, and real arithmetic, where a feasible setting for exact computer arithmetic has been formulated. We give a number of algorithms for computation in the theory of iterated function systems with applications in statistical physics and in period doubling route to chaos; we also show how efficient algorithms have been obtained for computing elementary functions in exact real arithmetic. (shrink)

We provide a fine‐grained analysis on the relation between König's lemma, weak König's lemma, and the decidable fan theorem in the context of constructive reverse mathematics. In particular, we show that double negated variants of König's lemma and weak König's lemma are equivalent to double negated variants of the general decidable fan theorem and the binary decidable fan theorem, respectively, over a nearly intuitionistic system containing a weak countable choice only. This implies that the general decidable fan theorem is not (...) equivalent to the binary decidable fan theorem in the absence of a strong countable choice. In addition, we introduce a principle which fills the gap between König's lemma and weak König's lemma, and show that König's lemma is equivalent to weak König's lemma plus this principle. We also solve several problems arising from the investigation. (shrink)

We give an overview of the role of equicontinuity of sequences of real-valued functions on [0,1] and related notions in classical mathematics, intuitionistic mathematics, Bishop’s constructive mathematics, and Russian recursive mathematics. We then study the logical strength of theorems concerning these notions within the programme of Constructive Reverse Mathematics. It appears that many of these theorems, like a version of Ascoli’s Lemma, are equivalent to fan-theoretic principles.

This article presents a weak system of intuitionistic second-order arithmetic, WKV, a subsystem of the one in S.C. Kleene, R.E. Vesley [The Foundations of Intuitionistic Mathematics: Especially in Relation to Recursive Functions, North-Holland Publishing Company, Amsterdam, 1965]. It is then shown that some statements of real analysis, like a version of the Heine–Borel Theorem, and some statements of logic, e.g. compactness of classical proposition calculus, are equivalent to the Fan Theorem in this system.