We examine, from a constructive perspective, the relation between the complements of S, T, and S ∩ T in X, where X is either a metric space or a normed linear space. The fundamental question addressed is: If x is distinct from each element of S ∩ T, if s ϵ S, and if t ϵ T, is x distinct from s or from t? Although the classical answer to this question is trivially affirmative, constructive answers involve Markov's principle and (...) the completeness of metric spaces. (shrink)

A characterisation of a type of weak-operator continuous linear functional on certain linear subsets of B, where H is a Hilbert space, is derived within Bishop-style constructive mathematics.

The nature of modern constructive mathematics, and its applications, actual and potential, to classical and quantum physics, are discussed.

An axiomatic development of the theory of apartness and nearness of a point and a set is introduced as a framework for constructive topology. Various notions of continuity of mappings between apartness spaces are compared; the constructive independence of one of the axioms from the others is demonstrated; and the product apartness structure is defined and analysed.

An axiomatic development of the theory of apartness and nearness of a point and a set is introduced as a framework for constructive topology. Various notions of continuity of mappings between apartness spaces are compared; the constructive independence of one of the axioms from the others is demonstrated; and the product apartness structure is defined and analysed.

It is proved, within Bishop's constructive mathematics , that, in the context of a Hilbert space, the Open Mapping Theorem is equivalent to a principle that holds in intuitionistic mathematics and recursive constructive mathematics but is unlikely to be provable within BISH.

The constructive functional calculus for a sequence of commuting selfadjoint operators on a separable Hilbert space is shown to be independent of the orthonormal basis used in its construction. The proof requires a constructive criterion for the absolute continuity of two positive measures in terms of test functions.

claims that constructive mathematics is inadequate for spacetime physics and hence that constructive mathematics cannot be considered as an alternative to classical mathematics. He also argues that the contructivist must be guilty of a form of a priorism unless she adopts a strong form of anti-realism for science. Here I want to dispute both claims. First, even if there are non-constructive results in physics this does not show that adequate constructive alternatives could not be formulated. Secondly, the constructivist adopts a (...) 'philosophy first' approach that Hellman rejects. This deep difference means that the viability of constructive mathematics cannot yet be decided by determining whether current scientific theories require classical mathematics. We need to decide which approach is most appropriate before we can even determine how we should go about deciding whether we should be constructive or classical mathematicians. (shrink)

We introduce the notion of a convex tree. We show that the binary expansion for real numbers in the unit interval ) is equivalent to weak König lemma ) for trees having at most two nodes at each level, and we prove that the intermediate value theorem is equivalent to \ for convex trees, in the framework of constructive reverse mathematics.

We study the system IFP of intuitionistic fixed point logic, an extension of intuitionistic first-order logic by strictly positive inductive and coinductive definitions. We define a realizability interpretation of IFP and use it to extract computational content from proofs about abstract structures specified by arbitrary classically true disjunction free formulas. The interpretation is shown to be sound with respect to a domain-theoretic denotational semantics and a corresponding lazy operational semantics of a functional language for extracted programs. We also show how (...) extracted programs can be translated into Haskell. As an application we extract a program converting the signed digit representation of real numbers to infinite Gray code from a proof of inclusion of the corresponding coinductive predicates. (shrink)

We show constructively that every quasi-convex, uniformly continuous function \ with at most one minimum point has a minimum point, where C is a convex compact subset of a finite dimensional normed space. Applications include a result on strictly quasi-convex functions, a supporting hyperplane theorem, and a short proof of the constructive fundamental theorem of approximation theory.

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)

Consequence is at the heart of logic; an account of consequence, of what follows from what, offers a vital tool in the evaluation of arguments. Since philosophy itself proceeds by way of argument and inference, a clear view of what logical consequence amounts to is of central importance to the whole discipline. In this book JC Beall and Greg Restall present and defend what thay call logical pluralism, the view that there is more than one genuine deductive consequence relation, a (...) position which has profound implications for many linguists as well as for philosophers. We should not search for one true logic, since there are many. (shrink)

Consequence is at the heart of logic; an account of consequence, of what follows from what, offers a vital tool in the evaluation of arguments. Since philosophy itself proceeds by way of argument and inference, a clear view of what logical consequence amounts to is of central importance to the whole discipline. In this book JC Beall and Greg Restall present and defend what thay call logical pluralism, the view that there is more than one genuine deductive consequence relation, a (...) position which has profound implications for many linguists as well as for philosophers. We should not search for one true logic, since there are many. (shrink)

Errett Bishop's work in constructive mathematics is overwhelmingly regarded as a turning point for mathematics based on intuitionistic logic. It brought new life to this form of mathematics and prompted the development of new areas of research that witness today's depth and breadth of constructive mathematics. Surprisingly, notwithstanding the extensive mathematical progress since the publication in 1967 of Errett Bishop's Foundations of Constructive Analysis, there has been no corresponding advances in the philosophy of constructive mathematics Bishop style. The aim of (...) this paper is to foster the philosophical debate about this form of mathematics. I begin by considering key elements of philosophical remarks by Bishop, especially focusing on Bishop's assessment of Brouwer. I then compare these remarks with ``traditional'' philosophical arguments for intuitionistic logic and argue that the latter are in tension with Bishop's views. ``Traditional'' arguments for intuitionistic logic turn out to be also in conflict with significant recent developments in constructive mathematics. This rises pressing questions for the philosopher of mathematics, especially with regard to the possibility of offering alternative philosophical arguments for constructive mathematics. I conclude with the suggestion to look anew at Bishop's own remarks for inspiration. (shrink)

In the early 1920s, the German mathematician David Hilbert (1862–1943) put forward a new proposal for the foundation of classical mathematics which has come to be known as Hilbert's Program. It calls for a formalization of all of mathematics in axiomatic form, together with a proof that this axiomatization of mathematics is consistent. The consistency proof itself was to be carried out using only what Hilbert called “finitary” methods. The special epistemological character of finitary reasoning then yields the required justification (...) of classical mathematics. Although Hilbert proposed his program in this form only in 1921, various facets of it are rooted in foundational work of his going back until around 1900, when he first pointed out the necessity of giving a direct consistency proof of analysis. Work on the program progressed significantly in the 1920s with contributions from logicians such as Paul Bernays, Wilhelm Ackermann, John von Neumann, and Jacques Herbrand. It was also a great influence on Kurt Gödel, whose work on the incompleteness theorems were motivated by Hilbert's Program. Gödel's work is generally taken to show that Hilbert's Program cannot be carried out. It has nevertheless continued to be an influential position in the philosophy of mathematics, and, starting with the work of Gerhard Gentzen in the 1930s, work on so-called Relativized Hilbert Programs have been central to the development of proof theory. (shrink)

Intersemiotic translation (IT) was defined by Roman Jakobson (The Translation Studies Reader, Routledge, London, p. 114, 2000) as “transmutation of signs”—“an interpretation of verbal signs by means of signs of nonverbal sign systems.” Despite its theoretical relevance, and in spite of the frequency in which it is practiced, the phenomenon remains virtually unexplored in terms of conceptual modeling, especially from a semiotic perspective. Our approach is based on two premises: (i) IT is fundamentally a semiotic operation process (semiosis) and (ii) (...) IT is a deeply iconic-dependent process. We exemplify our approach by means of literature to dance IT and we explore some implications for the development of a general model of IT. (shrink)

This book intends to show that radical naturalism, nominalism and strict finitism account for the applications of classical mathematics in current scientific theories. The applied mathematical theories developed in the book include the basics of calculus, metric space theory, complex analysis, Lebesgue integration, Hilbert spaces, and semi-Riemann geometry. The fact that so much applied mathematics can be developed within such a weak, strictly finitistic system, is surprising in itself. It also shows that the applications of those classical theories to the (...) finite physical world can be translated into the applications of strict finitism, which demonstrates the applicability of those classical theories without assuming the literal truth of those theories or the reality of infinity. Both professional researchers and students of philosophy of mathematics will benefit greatly from reading this book. (shrink)

The volume includes twenty-five research papers presented as gifts to John L. Bell to celebrate his 60th birthday by colleagues, former students, friends and admirers. Like Bell’s own work, the contributions cross boundaries into several inter-related fields. The contributions are new work by highly respected figures, several of whom are among the key figures in their fields. Some examples: in foundations of maths and logic ; analytical philosophy, philosophy of science, philosophy of mathematics and decision theory and foundations of economics. (...) Most articles are contributions to current philosophical debates, but contributions also include some new mathematical results, important historical surveys, and a translation by Wilfrid Hodges of a key work of arabic logic. (shrink)

Does science justify any part of mathematics and, if so, what part? These questions are related to the so-called indispensability arguments propounded, among others, by Quine and Putnam; moreover, both were led to accept significant portions of set theory on that basis. However, set theory rests on a strong form of Platonic realism which has been variously criticized as a foundation of mathematics and is at odds with scientific realism. Recent logical results show that it is possible to directly formalize (...) almost all, if not all, scientifically applicable mathematics in a formal system that is justified simply by Peano Arithmetic (via a proof-theoretical reduction). It is argued that this substantially vitiates the indispensability arguments. (shrink)

1. One theory or many? In 2004 a very interesting and readable article by Lenore Blum, entitled “Computing over the reals: Where Turing meets Newton,” appeared in the Notices of the American Mathematical Society. It explained a basic model of computation over the reals due to Blum, Michael Shub and Steve Smale (1989), subsequently exposited at length in their influential book, Complexity and Real Computation (1997), coauthored with Felipe Cucker. The ‘Turing’ in the title of Blum’s article refers of course (...) to Alan Turing, famous for his explication of the notion of mechanical computation on discrete data such as the integers. The ‘Newton’ there has to do to with the well known numerical method due to Isaac Newton for approximating the zeros of continuous functions under suitable conditions that is taken to be a paradigm of scientific computing. Finally, the meaning of “Turing meets Newton” in the title of Blum’s article has another, more particular aspect: in connection with the problem of controlling errors in the numerical solution of linear equations and inversion of matrices,Turing (1948) defined a notion of condition for the relation of changes in the output of a computation due to small changes in the input that is analogous to Newton’s definition of the derivative. The thrust of Blum’s 2004 article was that the BSS model of computation on the reals is the appropriate foundation for scientific computing in general. By way of response, two years later another very interesting and equally readable article appeared in the Notices, this time by Mark Braverman and Stephen Cook (2006) entitled “Computing over the reals: Foundations for scientific computing,” in which the authors argued that the requisite foundation is provided by a quite different “bit computation” model, that is in fact prima facie incompatible with the BSS model. The bit computation model goes back to ideas due to Stefan Banach and Stanislaw Mazur in the latter part of the 1930s, but the first publication was not made until Mazur (1963).. (shrink)