All Topics  
Foundations of mathematics

 

   Email Print
   Bookmark   Link






 

Foundations of mathematics



 
 
Foundations of mathematics is a term sometimes used for certain fields of mathematics
Mathematics

Mathematics is the study of quantity, structure, space, change, and related topics of pattern and form. Mathematicians seek out patterns whether found in numbers, space, natural science, computers, imaginary abstractions, or elsewhere....
, such as mathematical logic
Mathematical logic

Mathematical logic is a subfield of mathematics and logic with close connections to computer science and philosophical logic. The field includes the mathematical study of logic and the applications of formal logic to other areas of mathematics....
, axiomatic set theory, proof theory
Proof theory

Proof theory is a branch of mathematical logic that represents Mathematical proofs as formal mathematical objects, facilitating their analysis by mathematical techniques....
, model theory
Model theory

In mathematics, model theory is the study of mathematical Structure such as Group , fields, graph , or even models of set theory, using tools from mathematical logic....
, and recursion theory
Recursion theory

Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees....
. The search for foundations of mathematics is also a central question of the philosophy of mathematics
Philosophy of mathematics

The philosophy of mathematics is the branch of philosophy that studies the philosophical assumptions, foundations, and implications of mathematics....
: On what ultimate basis can mathematical statements
Proposition

This article is about the term proposition in logic and philosophy; for other uses see PropositionIn logic and philosophy, proposition refers to either the "content" or Meaning of a meaningful declarative sentence or the pattern of symbols, marks, or sounds that make up a meaningful declarative sentence....
 be called true
True

True is the adjective form of the word truth.True may also refer to:...
?

onism:“Platonists, such as Kurt Gödel, hold that numbers are abstract, necessarily existing objects, independent of the human mind”

Formalism:“Formalists, such as David Hilbert (1862–1943), hold that mathematics is no more or less than mathematical language.






Discussion
Ask a question about 'Foundations of mathematics'
Start a new discussion about 'Foundations of mathematics'
Answer questions from other users
Full Discussion Forum



Encyclopedia


Foundations of mathematics is a term sometimes used for certain fields of mathematics
Mathematics

Mathematics is the study of quantity, structure, space, change, and related topics of pattern and form. Mathematicians seek out patterns whether found in numbers, space, natural science, computers, imaginary abstractions, or elsewhere....
, such as mathematical logic
Mathematical logic

Mathematical logic is a subfield of mathematics and logic with close connections to computer science and philosophical logic. The field includes the mathematical study of logic and the applications of formal logic to other areas of mathematics....
, axiomatic set theory, proof theory
Proof theory

Proof theory is a branch of mathematical logic that represents Mathematical proofs as formal mathematical objects, facilitating their analysis by mathematical techniques....
, model theory
Model theory

In mathematics, model theory is the study of mathematical Structure such as Group , fields, graph , or even models of set theory, using tools from mathematical logic....
, and recursion theory
Recursion theory

Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees....
. The search for foundations of mathematics is also a central question of the philosophy of mathematics
Philosophy of mathematics

The philosophy of mathematics is the branch of philosophy that studies the philosophical assumptions, foundations, and implications of mathematics....
: On what ultimate basis can mathematical statements
Proposition

This article is about the term proposition in logic and philosophy; for other uses see PropositionIn logic and philosophy, proposition refers to either the "content" or Meaning of a meaningful declarative sentence or the pattern of symbols, marks, or sounds that make up a meaningful declarative sentence....
 be called true
True

True is the adjective form of the word truth.True may also refer to:...
?

Philosophical foundations of mathematics


Summary of the three philosophies

Platonism:“Platonists, such as Kurt Gödel, hold that numbers are abstract, necessarily existing objects, independent of the human mind”

Formalism:“Formalists, such as David Hilbert (1862–1943), hold that mathematics is no more or less than mathematical language. It is simply a series of games...”

Intuitionism:“Intuitionists, such as L. E. J. Brouwer (1882–1966), hold that mathematics is a creation of the human mind. Numbers, like fairy tale characters, are merely mental entities, which would not exist if there were never any human minds to think about them.”

Platonism

The foundational philosophy of Platonist mathematical realism
Philosophy of mathematics

The philosophy of mathematics is the branch of philosophy that studies the philosophical assumptions, foundations, and implications of mathematics....
, as exemplified by mathematician Kurt Gödel
Kurt Gödel

Kurt G?del was an Austrian-United States logician, mathematician and philosopher. One of the most significant logicians of all time, G?del made an immense impact upon scientific and philosophical thinking in the 20th century, a time when many, such as Bertrand Russell, A....
, proposes the existence of a world of mathematical objects independent of humans; the truths about these objects are discovered by humans. In this view, the laws of nature and the laws of mathematics have a similar status, and the effectiveness
The Unreasonable Effectiveness of Mathematics in the Natural Sciences

In 1960, the physicist Eugene Wigner published an article titled "The Unreasonable Effectiveness of Mathematics in the Natural Sciences", arguing that the way in which the mathematical structure of a physical theory often points the way to further advances in that theory and even to empirical predictions, is not a coincidence but must reflect...
 ceases to be unreasonable. Not our axioms, but the very real world of mathematical objects forms the foundation. The obvious question, then, is: how do we access this world?

Formalism

The foundational philosophy of formalism
Philosophy of mathematics

The philosophy of mathematics is the branch of philosophy that studies the philosophical assumptions, foundations, and implications of mathematics....
, as exemplified by David Hilbert
David Hilbert

David Hilbert was a Germany mathematician, recognized as one of the most influential and universal mathematicians of the 19th and early 20th centuries....
, is based on axiomatic set theory and formal logic. Virtually all mathematical theorem
Theorem

In mathematics, a theorem is a statement Mathematical proof on the basis of previously accepted or established statements such as axioms.In formal mathematical logic, the concept of a theorem may be taken to mean a formula that can be formal proof according to the deductive system of a fixed formal system....
s today can be formulated as theorems of set theory. The truth of a mathematical statement, in this view, is then nothing but the claim that the statement can be derived from the axioms of set theory using the rules of formal logic.

Merely the use of formalism alone does not explain several issues: why we should use the axioms we do and not some others, why we should employ the logical rules we do and not some others, why do "true" mathematical statements (e.g., the laws of arithmetic
Peano axioms

In mathematical logic, the Peano axioms, also known as the Dedekind?Peano axioms or the Peano postulates, are a set of axioms for the natural numbers presented by the 19th century Italian people mathematician Giuseppe Peano....
) appear to be true, and so on. In some cases these may be sufficiently answered through the study of formal theories, in disciplines such as reverse mathematics
Reverse mathematics

Reverse mathematics is a program in mathematical logic that seeks to determine which axioms are required to prove theorems of mathematics. The method can briefly be described as "going backwards from the theorems to the axioms." This contrasts with the ordinary mathematical practice of deriving theorems from axioms....
 and computational complexity theory
Computational complexity theory

Computational complexity theory, as a branch of the theory of computation in computer science, investigates the problems related to the Computational resource required for the execution of algorithms , and the inherent difficulty in providing efficient algorithms for specific computational problems....
. Formal logical systems also run the risk of inconsistency
Consistency proof

In logic, a consistent theory is one that does not contain a contradiction. The lack of contradiction can be defined in either semantic or syntactic terms....
; in Peano arithmetic
Peano axioms

In mathematical logic, the Peano axioms, also known as the Dedekind?Peano axioms or the Peano postulates, are a set of axioms for the natural numbers presented by the 19th century Italian people mathematician Giuseppe Peano....
, this arguably has already been settled with several proofs of consistency
Consistency proof

In logic, a consistent theory is one that does not contain a contradiction. The lack of contradiction can be defined in either semantic or syntactic terms....
, but there is debate over whether or not they are sufficiently finitary
Finitism

In the philosophy of mathematics, finitism is an extreme form of Mathematical constructivism, according to which a mathematical object does not exist unless it can be constructed from natural numbers in a finite set number of steps....
 to be meaningful. Gödel's second incompleteness theorem establishes that logical systems of arithmetic can never contain a valid proof of their own consistency
Consistency proof

In logic, a consistent theory is one that does not contain a contradiction. The lack of contradiction can be defined in either semantic or syntactic terms....
. What Hilbert wanted to do was prove a logical system S was consistent, based on principles P that only made up a small part of S. But Gödel proved that the principles P could not even prove P to be consistent, let alone S!

Intuitionism

The foundational philosophy of intuitionism
Intuitionism

In the philosophy of mathematics, intuitionism, or neointuitionism , is an approach to mathematics as the constructive mental activity of humans....
 or constructivism
Constructivism (mathematics)

In the philosophy of mathematics, constructivism asserts that it is necessary to find a mathematical object to prove that it exists. When one assumes that an object does not exist and reductio ad absurdum, one still has not found the object and therefore not proved its existence, according to constructivists....
, as exemplified in the extreme by Brouwer
Luitzen Egbertus Jan Brouwer

Luitzen Egbertus Jan Brouwer ['l?yt.s?n ?x.'b??.t?s j?n 'b??u.??] , usually cited as L. E. J. Brouwer but known to his friends as Bertus, was a Netherlands mathematician and philosopher, a graduate of the University of Amsterdam, who worked in topology, set theory, measure theory and complex analysis....
 and more coherently by Stephen Kleene, requires proofs to be "constructive" in nature – the existence of an object must be demonstrated rather than inferred from a demonstration of the impossibility of its non-existence. For example, as a consequence of this the form of proof known as reductio ad absurdum
Reductio ad absurdum

Reductio ad absurdum , also known as an apagogical argument, reductio ad impossibile, or proof by contradiction, is a type of logical argument where one assumes a claim for the sake of argument and derives an absurd or ridiculous outcome, and then concludes that the original claim must have been wrong as it led to an abs...
 is suspect.

Some modern theories
Theory

For a more detailed account of theories as expressed in formal language as they are studied in mathematical logic see Theory A theory, in the general sense of the word, is an analytic structure designed to explain a set of observations....
 in the philosophy of mathematics deny the existence of foundations in the original sense. Some theories tend to focus on mathematical practice
Mathematical practice

Mathematical practice is used to distinguish the working practices of professional mathematicians from the end result of mathematical proof and published theorems....
, and aim to describe and analyze the actual working of mathematicians as a social group. Others try to create a cognitive science of mathematics
Cognitive science of mathematics

The cognitive science of mathematics is the study of mathematics ideas using the techniques of cognitive science. It proposes to ground the foundations of mathematics in the empirical study of human cognition and metaphor, and to analyze mathematical ideas in terms of the human experiences, metaphors, generalizations, and other cognitive me...
, focusing on human cognition as the origin of the reliability of mathematics when applied to the real world. These theories would propose to find foundations only in human thought, not in any objective outside construct. The matter remains controversial.

Foundational crisis


The foundational crisis of mathematics (in German
German language

German is a West Germanic languages, thus related to and classified alongside English language and Dutch language. It is one of the world's world language and the most widely spoken mother tongue in the European Union....
: Grundlagenkrise der Mathematik) was the early 20th century's term for the search for proper foundations of mathematics.

After several schools of the philosophy of mathematics
Philosophy of mathematics

The philosophy of mathematics is the branch of philosophy that studies the philosophical assumptions, foundations, and implications of mathematics....
 ran into difficulties one after the other in the 20th century, the assumption that mathematics had any foundation that could be stated within mathematics
Mathematics

Mathematics is the study of quantity, structure, space, change, and related topics of pattern and form. Mathematicians seek out patterns whether found in numbers, space, natural science, computers, imaginary abstractions, or elsewhere....
 itself began to be heavily challenged.

One attempt after another to provide unassailable foundations for mathematics was found to suffer from various paradox
Paradox

A paradox is a Proposition or group of statements that leads to a contradiction or a situation which defies intuition ; or, it can be an apparent contradiction that actually expresses a non-dual truth ....
es (such as Russell's paradox
Russell's paradox

Part of fundamental mathematics, Russell's paradox , discovered by Bertrand Russell in 1901, showed that the naive set theory of Gottlob Frege leads to a contradiction....
) and to be inconsistent
Consistency proof

In logic, a consistent theory is one that does not contain a contradiction. The lack of contradiction can be defined in either semantic or syntactic terms....
: an undesirable situation in which every mathematical statement that can be formulated in a proposed system (such as 2 + 2 = 5) can also be proved in the system.

Various schools of thought on the right approach to the foundations of mathematics were fiercely opposing each other. The leading school was that of the formalist
Formalism

The term formalism describes an emphasis on form over content or meaning in the arts, literature, or philosophy. A practitioner of formalism is called a formalist....
 approach, of which David Hilbert
David Hilbert

David Hilbert was a Germany mathematician, recognized as one of the most influential and universal mathematicians of the 19th and early 20th centuries....
 was the foremost proponent, culminating in what is known as Hilbert's program
Hilbert's program

Hilbert's program, formulated by Germans mathematician David Hilbert in the 1920s, was to formalize all existing theories to a finite, complete set of axioms, and provide a proof that these axioms were consistent....
, which thought to ground mathematics on a small basis of a logical system proved sound by metamathematical
Metamathematics

Metamathematics is `mathematics used to study mathematics', or it involves the application of a philosophy of mathematics. The first part of this general description appears tautological, or is perhaps open to Bertrand Russell's and Alfred Whitehead's types of antimonies , as described in their famous "Principia Mathematica"....
 finitistic
Finitism

In the philosophy of mathematics, finitism is an extreme form of Mathematical constructivism, according to which a mathematical object does not exist unless it can be constructed from natural numbers in a finite set number of steps....
 means. The main opponent was the intuitionist
Intuitionism

In the philosophy of mathematics, intuitionism, or neointuitionism , is an approach to mathematics as the constructive mental activity of humans....
 school, led by L. E. J. Brouwer, which resolutely discarded formalism as a meaningless game with symbols (van Dalen, 2008). The fight was acrimonious. In 1920 Hilbert succeeded in having Brouwer, whom he considered a threat to mathematics, removed from the editorial board of Mathematische Annalen
Mathematische Annalen

The Mathematische Annalen is a German language mathematical research journal published by Springer Science+Business Media. It was founded in 1868 by Alfred Clebsch and Carl Neumann....
, the leading mathematical journal of the time.

Gödel's incompleteness theorems
Gödel's incompleteness theorems

In mathematical logic, G?del's incompleteness theorems, proved by Kurt G?del in 1931, are two theorems stating inherent limitations of all but the most trivial formal systems for arithmetic of mathematical interest....
, proved in 1931, showed that essential aspects of Hilbert's program could not be attained. In Gödel's
Kurt Gödel

Kurt G?del was an Austrian-United States logician, mathematician and philosopher. One of the most significant logicians of all time, G?del made an immense impact upon scientific and philosophical thinking in the 20th century, a time when many, such as Bertrand Russell, A....
 first result he showed how to construct, for any sufficiently powerful and consistent recursively axiomatizable system – such as necessary to axiomatize the elementary theory of arithmetic
Arithmetic

Arithmetic or arithmetics is the oldest and most elementary branch of mathematics, used by almost everyone, for tasks ranging from simple day-to-day counting to advanced science and business calculations....
 – a statement that can be shown to be true, but that does not follow from the rules of the system. It thus became clear that the notion of mathematical truth can not be reduced to a purely formal system
Formal system

In logic, a formal system consists of a formal language together with a deductive system which consists of a set of inference rules and/or axioms....
 as envisaged in Hilbert's program. In a next result Gödel showed that such a system was not powerful enough for proving its own consistency, let alone that a simpler system could do the job. This dealt a final blow to the heart of Hilbert's program, the hope that consistency could be established by finitistic means (it was never made clear exactly what axioms were the "finitistic" ones, but whatever axiomatic system was being referred to, it was a 'weaker' system than the system whose consistency it was supposed to prove). Meanwhile, the intuitionistic school had failed to attract adherents among working mathematicians, and floundered due to the difficulties of doing mathematics under the constraint of constructivism
Constructivism (mathematics)

In the philosophy of mathematics, constructivism asserts that it is necessary to find a mathematical object to prove that it exists. When one assumes that an object does not exist and reductio ad absurdum, one still has not found the object and therefore not proved its existence, according to constructivists....
.

In a sense, the crisis has not been resolved, but faded away: most mathematicians either do not work from axiomatic systems, or if they do, do not doubt the consistency of ZFC, generally their preferred axiomatic system. In most of mathematics as it is practiced, the various logical paradoxes never played a role anyway, and in those branches in which they do (such as logic
Mathematical logic

Mathematical logic is a subfield of mathematics and logic with close connections to computer science and philosophical logic. The field includes the mathematical study of logic and the applications of formal logic to other areas of mathematics....
 and category theory
Category theory

In mathematics, category theory deals in an abstract way with mathematical structures and relationships between them: it abstracts from set s and function s to objects linked in diagrams by morphisms or arrows....
), they may be avoided.

A working perspective

To give an example, in number theory there is a huge body of doctrine, a tiny fraction of which has been developed in a particular axiomatic system, say Peano arithmetic (PA). Most of this work could be developed in PA; as a famous example, the prime number theorem
Prime number theorem

In number theory, the prime number theorem describes the asymptotic analysis distribution of the prime numbers. The prime number theorem gives a rough description of how the primes are distributed....
 is provable in PRA
Primitive recursive arithmetic

Primitive recursive arithmetic, or PRA, is a quantifier-free formalization of the natural numbers. It was first proposed by Thoralf Skolem as a formalization of his finitist conception of the foundations of mathematics, and it is widely agreed that all reasoning of PRA is finitist....
 (Sudac (2001)), a much weaker theory than PA. But the working number theorist is concerned with proving theorems from initial assumptions which are obviously true using proof methods which are obviously correct, not with any particular logical system. In fact, the "crisis"-causing assertions discovered by Gödel are assertions about Diophantine equation
Diophantine equation

In mathematics, a Diophantine equation is an indeterminate equation polynomial equation that allows the variables to be integers only. Diophantine problems have fewer equations than unknown variables and involve finding integers that work correctly for all equations....
s, one of the main avenues in number theory. It may or may not be the case that there is a fundamental limit to what humans can understand about numbers (i.e., there may be true number-theoretical principles which cannot be perceived as being true by any human), but Gödel's theorem does not tell us which of these is the case, and we have no way of knowing. It may or may not be that we are required to introduce principles which are not expressible in the language of first order arithmetic in order to decide questions which are (e.g. the consistency of PA), but Gödel's theorem does not tell us which of these is the case, and again we have no way of knowing. It is often asserted that in light of Gödel's theorem one must introduce set-theoretical principles in order to decide certain number theoretical questions, but this assertion is unjustified. Gödel's theorem does not put any such constraints on the nature of the principles involved (i.e. the language in which they must be expressed). The attitude of the working number theorist is thus a reasonable one: one does not spend time thinking about such things, as there is simply no way to know. Instead one continues to prove theorems, and true principles which may be outside this or that logical system will be appealed to as required. Such principles will be introduced by people thinking about and solving actual problems, on the frontline. The problems (assuming there is no limit to what humans can understand about numbers) will be solved by people carrying on in the same way as they did before.

See also


External links