Encyclopedia  |   World Factbook  |   World Flags  |   Reference Tables  |   List of Lists     
   Academic Disciplines  |   Historical Timeline  |   Themed Timelines  |   Biographies  |   How-Tos     
Sponsor by The Tattoo Collection
Mathematical constructivism
Main Page | See live article | Alphabetical index

Mathematical constructivism

In the philosophy of mathematics, mathematical constructivism asserts that it is necessary to find (or "construct") a mathematical object to prove that it exists. When you assume that an object does not exist, and derive a contradiction from that assumption, you still have not found it, and therefore not proved its existence, according to constructivists.

Constructivism is often confused with mathematical intuitionism, but in fact, intuitionism is only one kind of constructivism. Intuitionism maintains that the foundations of mathematics lie in the individual mathematician's intuition, thereby making mathematics into an intrinsically subjective activity. Constructivism does not, and is entirely consonant with an objective view of mathematics.

Table of contents
1 Constructivist mathematics
2 Attitude of mathematicians
3 Mathematicians who have contributed to constructivism
4 Branches of constructivist mathematics
5 See also
6 External links

Constructivist mathematics

Constructivist mathematics uses constructivist logic, which closely identifies truth with proof. To prove constructively we must prove one (or both) of and . To prove constructively we must present a particular together with a proof of . To prove constructively we must present an algorithm that takes an and outputs a proof of .

Constructivism also rejects the use of infinite objects, such as infinite sets and sequences.

Example from real analysis

In classical real analysis, one way to construct a real number is as a pair of Cauchy sequences of the rational numbers. This construction doesn't work in constructivist mathematics because the sequences are infinite.

Instead, we can represent a real number as an algorithm that takes a positive integer and outputs a pair of rationals such that

so that as increases, the interval gets smaller, and the intersection of the first such intervals is non-empty. We can use to compute as close a rational approximation as we like to the real number it represents.

Under this definition, the real number can be represented by the algorithm that computes for each the largest such that and then outputs the pair .

This definition corresponds to the classical definition using Cauchy sequences, except for the requirement that the sequences are constructive: that is, we have an algorithm for computing the th element in the sequence and hence an algorithm for computing an arbitrarily accurate rational approximation to .

Attitude of mathematicians

Traditionally, mathematicians have been suspicious, if not downright antagonistic, towards mathematical constructivism, largely because of the limitations that it poses for constructive analysis. These views were forcefully expressed by David Hilbert in 1928, when he wrote in Die Grundlagen der Mathematik, "Taking the principle of excluded middle from the mathematician would be the same, say, as proscribing the telescope to the astronomer or to the boxer the use of his fists" [1]. (The law of excluded middle is not valid in constructivist logic.) Errett Bishop, in his 1967 work Foundations of Constructive Analysis, worked to dispel these fears by developing a great deal of traditional analysis in a constructive framework. Nevertheless, not every mathematician accepts that Bishop did so successfully, since his book is necessarily more complicated than a classical analysis text would be. In any case, most mathematicians see no need to restrict themselves to constructivist methods, even if this can be done.

[1] Translation from the Stanford Encyclopedia of Philosophy, http://plato.stanford.edu/entries/mathematics-constructive/.

Mathematicians who have contributed to constructivism

Branches of constructivist mathematics

See also

External links

Computability Logic Homepage