 |
Business | Industries | Finance | Tax |
| Index: > A B C D E F G H I J K L M N O P Q R S T U V W X Y Z |
|
|||||
| First Prev [ 1 2 ] Next Last |
Constructivism is often confused with 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.
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.
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 .
Note that the constructivity requirement makes the above definition inconsistent with the usual non-constructive definitions of the reals: Since every algorithm must necessarily be a finite sequence over a finite set of instructions , there exists a bijective function . Therefore the set of all algorithms has the same cardinality as the set of all naturals. When using a non-constructive definition, Cantor's diagonal argument proves that the reals have higher cardinality than the natural numbers.
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 middleThe law of excluded middle tertium non datur in Latin) states that for any proposition P, it is true that (P or not-P). For example, if P is : Joe is bald then the inclusive disjunction : Joe is bald, or Joe is not bald is true. This is not quite the same is not valid in constructivist logic.)
Errett BishopErrett Bishop ( 1928- 1983) was a mathematician who managed to prove versions of the most important theorems in real analysis within the constructivist framework. See constructivist analysis. He also worked in functional analysis. Bishop, Errett Bishop, E, in his 1967Events January January 4 British motorboat racer Donald Campbell dies while attempting a water speed record in Coniston Lake. January 4 Algerian revolutionary Mohammed Khider is shot in Madrid. January 6 Vietnam War: USMC and ARVN troops launch " Operatio 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 PhilosophyEncyclopedias Online encyclopedias The Stanford Encyclopedia of Philosophy is an encyclopedia that uses established methods of development, such as the use of specialist authors selected by a editor or an editorial committee who is competent (though not n, http://plato.stanford.edu/entries/mathematics-constructive/.
| Politics | Business | Finance |
 |
 |
 |
|