For the purposes of this monograph, "by a degree" is meant a degree of recursive unsolvability. A degree [script bold]m is said to be minimal if 0 is the unique degree less than [script bold]m. Each of the six chapters of this self-contained monograph is devoted to the proof of an existence theorem for minimal degrees.

The first part of the paper introduces the varieties of modern constructive mathematics, concentrating on Bishop's constructive mathematics. it gives a sketch of both Myhill's axiomatic system for BISH and a constructive axiomatic development of the real line R. The second part of the paper focusses on the relation between constructive mathematics and programming, with emphasis on Martin-L6f 's theory of types as a formal system for BISH.

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

This is an introduction to, and survey of, the constructive approaches to pure mathematics. The authors emphasise the viewpoint of Errett Bishop's school, but intuitionism. Russian constructivism and recursive analysis are also treated, with comparisons between the various approaches included where appropriate. Constructive mathematics is now enjoying a revival, with interest from not only logicans but also category theorists, recursive function theorists and theoretical computer scientists. This account for non-specialists in these and other disciplines.

Stereotypes of social construction suggest that the existence of social constructs is accidental and that such constructs have arbitrary and subjective features. In this paper, I explore a conception of social construction according to which it consists in the collective imposition of function onto reality and show that, according to this conception, these stereotypes are incorrect. In particular, I argue that the collective imposition of function onto reality is typically non-accidental and that the products of such imposition frequently have non-arbitrary (...) and objective features. These conclusions are interesting in and of themselves since they debunk important aspects of our socially constructed conception of social construction. Yet, additionally, they have important implications for the viability of mathematical social constructivism since resistance to such constructivism is frequently grounded in the observation that mathematics is non-accidental, non-arbitrary, and objective. As a secondary focus, I explore these implications in this paper. (shrink)

It is argued that Hellman's arguments purporting to demonstrate that constructive mathematics cannot cope with unbounded operators on a Hilbert space are seriously flawed, and that there is no evidence that his thesis is correct.

The first part of the paper introduces the varieties of modern constructive mathematics, concentrating on Bishop's constructive mathematics (BISH). it gives a sketch of both Myhill's axiomatic system for BISH and a constructive axiomatic development of the real line R. The second part of the paper focusses on the relation between constructive mathematics and programming, with emphasis on Martin-L6f 's theory of types as a formal system for BISH.

The aim of the present thesis is twofold. First we propose a constructive solution to Frege's puzzle using an approach based on homotopy type theory, a newly proposed foundation of mathematics that possesses a higher-dimensional treatment of equality. We claim that, from the viewpoint of constructivism, Frege's solution is unable to explain the so-called ‘cognitive significance' of equality statements, since, as we shall argue, not only statements of the form 'a = b', but also 'a = a' may (...) contribute to an extension of knowledge. Second, we study this higher-dimensional account of equality from a constructive (computational) standpoint and, based on these considerations, we offer a new perspective to the project proposed by Peter Aczel of developing conventions and notations for an informal style of doing mathematics in type theory. To that end, we adopt the cubical type theory of Angiuli, Favonia and Harper, a framework that can be seen as constructive refinement of the ideas of homotopy type theory. (shrink)

In this article I present a disagreement between classical and constructive approaches to predicativity regarding the predicative status of so-called generalised inductive definitions. I begin by offering some motivation for an enquiry in the predicative foundations of constructive mathematics, by looking at contemporary work at the intersection between mathematics and computer science. I then review the background notions and spell out the above-mentioned disagreement between classical and constructive approaches to predicativity. Finally, I look at possible (...) ways of defending the constructive predicativity of inductive definitions. (shrink)

We show that numerous distinctive concepts of constructive mathematics arise automatically from an “antithesis” translation of affine logic into intuitionistic logic via a Chu/Dialectica construction. This includes apartness relations, complemented subsets, anti-subgroups and anti-ideals, strict and non-strict order pairs, cut-valued metrics, and apartness spaces. We also explain the constructive bifurcation of some classical concepts using the choice between multiplicative and additive affine connectives. Affine logic and the antithesis construction thus systematically “constructivize” classical definitions, handling the resulting bookkeeping (...) automatically. (shrink)

The purpose of this paper is an axiomatic study of the interrelations between certain continuity properties. We deal with principles which are equivalent to the statements "every mapping is sequentially nondiscontinuous", "every sequentially nondiscontinuous mapping is sequentially continuous", and "every sequentially continuous mapping is continuous". As corollaries, we show that every mapping of a complete separable space is continuous in constructive recursive mathematics (the Kreisel-Lacombe-Schoenfield-Tsejtin theorem) and in intuitionism.

We discuss the foundations of constructive mathematics, including recursive mathematics and intuitionism, in relation to classical mathematics. There are connections with the foundations of physics, due to the way in which the different branches of mathematics reflect reality. Many different axioms and their interrelationship are discussed. We show that there is a fundamental problem in BISH (Bishop’s school of constructive mathematics) with regard to its current definition of ‘continuous function’. This problem is closely (...) related to the definition in BISH of ‘locally compact’. Possible approaches to this problem are discussed. Topology seems to be a key to understanding many issues. We offer several new simplifying axioms, which can form bridges between the various branches of constructive mathematics and classical mathematics (‘reuniting the antipodes’). We give a simplification of basic intuitionistic theory, especially with regard to so-called ‘bar induction’. We then plead for a limited number of axiomatic systems, which differentiate between the various branches of mathematics. Finally, in the appendix we offer BISH an elegant topological definition of ‘locally compact’, which unlike the current definition is equivalent to the usual classical and/or intuitionistic definition in classical and intuitionistic mathematics, respectively. (shrink)

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 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)

The purpose of this paper is an axiomatic study of the interrelations between certain continuity properties. We show that every mapping is sequentially continuous if and only if it is sequentially nondiscontinuous and strongly extensional, and that "every mapping is strongly extensional", "every sequentially nondiscontinuous mapping is sequentially continuous", and a weak version of Markov's principle are equivalent. Also, assuming a consequence of Church's thesis, we prove a version of the Kreisel-Lacombe-Shoenfield-Tsĕitin theorem.

This edited collection bridges the foundations and practice of constructive mathematics and focuses on the contrast between the theoretical developments, which have been most useful for computer science (ie: constructive set and type theories), and more specific efforts on constructive analysis, algebra and topology. Aimed at academic logician, mathematicians, philosophers and computer scientists with contributions from leading researchers, it is up to date, highly topical and broad in scope.

We apply some tools developed in categorical logic to give an abstract description of constructions used to formalize constructive mathematics in foundations based on intensional type theory. The key concept we employ is that of a Lawvere hyperdoctrine for which we describe a notion of quotient completion. That notion includes the exact completion on a category with weak finite limits as an instance as well as examples from type theory that fall apart from this.

We present a two-level theory to formalize constructive mathematics as advocated in a previous paper with G. Sambin.One level is given by an intensional type theory, called Minimal type theory. This theory extends a previous version with collections.The other level is given by an extensional set theory that is interpreted in the first one by means of a quotient model.This two-level theory has two main features: it is minimal among the most relevant foundations for constructive mathematics; (...) it is constructive thanks to the way the extensional level is linked to the intensional one which fulfills the “proofs-as-programs” paradigm and acts as a programming language. (shrink)

We will overview the results in an informal approach to constructive reverse mathematics, that is reverse mathematics in Bishop’s constructive mathematics, especially focusing on compactness properties and continuous properties.

We will overview the results in an informal approach to constructive reverse mathematics, that is reverse mathematics in Bishop’s constructive mathematics, especially focusing on compactness properties and continuous properties.

Integration within constructive, especially intuitionistic mathematics in the sense of L. E. J. Brouwer, slightly differs from formal integration theories: Some classical results, especially Lebesgue's dominated convergence theorem, have tobe substituted by appropriate alternatives. Although there exist sophisticated, but rather laborious proposals, e.g. by E. Bishop and D. S. Bridges , the reference to partitions and the Riemann-integral, also with regard to the results obtained by R. Henstock and J. Kurzweil , seems to give a better direction. Especially, (...) convergence theorems can be proved by introducing the concept of “equi-integrability”. (shrink)

The paradox of phase transitions raises the problem of how to reconcile the fact that we see phase transitions happen in concrete, finite systems around us, with the fact that our best theories—i.e. statistical-mechanical theories of phase transitions—tell us that phase transitions occur only in infinite systems. In this paper we aim to clarify to which extent this paradox is relative to the mathematical framework which is used in these theories, i.e. classical mathematics. To this aim, we will explore (...) the philosophical consequences of adopting constructive instead of classical mathematics in a statistical-mechanical theory of phase transitions. It will be shown that constructive mathematics forces certain ‘de-idealizations’ of such theories: talk of actually infinite systems is meaningless, there are no discontinuous functions, and—in a sense which will be clarified—constructive real numbers reflect our imperfect methods of determining the values of physical quantities. As such, so it will be argued, constructive mathematics offers a means to gain insight in the idealizations introduced in classical theories and the philosophical issues surrounding them. (shrink)

This book is concerned with `the problem of existence in mathematics'. It develops a mathematical system in which there are no existence assertions but only assertions of the constructibility of certain sorts of things. It explores the philosophical implications of such an approach through an examination of the writings of Field, Burgess, Maddy, Kitcher, and others.

The paradox of phase transitions raises the problem of how to reconcile the fact that we see phase transitions happen in concrete, finite systems around us, with the fact that our best theories—i.e. statistical-mechanical theories of phase transitions—tell us that phase transitions occur only in infinite systems. In this paper we aim to clarify to which extent this paradox is relative to the mathematical framework which is used in these theories, i.e. classical mathematics. To this aim, we will explore (...) the philosophical consequences of adopting constructive instead of classical mathematics in a statistical-mechanical theory of phase transitions. It will be shown that constructive mathematics forces certain ‘de-idealizations’ of such theories: talk of actually infinite systems is meaningless, there are no discontinuous functions, and—in a sense which will be clarified—constructive real numbers reflect our imperfect methods of determining the values of physical quantities. As such, so it will be argued, constructive mathematics offers a means to gain insight in the idealizations introduced in classical theories and the philosophical issues surrounding them. (shrink)

As argued in Hellman (1993), the theorem of Pour-El and Richards (1983) can be seen by the classicist as limiting constructivist efforts to recover the mathematics for quantum mechanics. Although Bridges (1995) may be right that the constructivist would work with a different definition of 'closed operator', this does not affect my point that neither the classical unbounded operators standardly recognized in quantum mechanics nor their restrictions to constructive arguments are recognizable as objects by the constructivist. Constructive (...) substitutes that may still be possible necessarily involve additional 'incompleteness' in the mathematical representation of quantum phenomena. Concerning a second line of reasoning in Hellman (1993), its import is that constructivist practice is consistent with a 'liberal' stance but not with a 'radical', verificationist philosophical position. Whether such a position is actually espoused by certain leading constructivists, they are invited to clarify. (shrink)

We represent the well-known surprise exam paradox in constructive and computable mathematics and offer solutions. One solution is based on Brouwer’s continuity principle in constructive mathematics, and the other involves type 2 Turing computability in classical mathematics. We also discuss the backward induction paradox for extensive form games in constructive logic.

This paper discusses Michael Dummett’s attempt to base the use of intuitionistic logic in mathematics on a proof-conditional semantics. This project is shown to face significant obstacles resulting from the existence of variants of standard intuitionistic logic. In order to overcome these obstacles, Dummett and his followers must give an intuitionistically acceptable completeness proof for intuitionistic logic relative to the BHK interpretation of the logical constants, but there are reasons to doubt that such a proof is possible. The paper (...) concludes by proposing an alternative way of thinking about why one should use intuitionistic logic when doing mathematics. (shrink)