Foundations of mathematics

Short description: Basic framework of mathematics

Not to be confused with Foundations of Mathematics (book).

Template:Math topics TOC

Foundations of mathematics are the logical and mathematical frameworks that allow the development of mathematics without generating self-contradictory theories, and to have reliable concepts of theorems, proofs, algorithms, etc. in particular. This may also include the philosophical study of the relation of this framework with reality.[1]

The term "foundations of mathematics" was not coined before the end of the 19th century, although foundations were first established by the ancient Greek philosophers under the name of Aristotle's logic and systematically applied in Euclid's Elements. A mathematical assertion is considered as truth only if it is a theorem that is proved from true premises by means of a sequence of syllogisms (inference rules), the premises being either already proved theorems or self-evident assertions called axioms or postulates.

These foundations were tacitly assumed to be definitive until the introduction of infinitesimal calculus by Isaac Newton and Gottfried Wilhelm Leibniz in the 17th century. This new area of mathematics involved new methods of reasoning and new basic concepts (continuous functions, derivatives, limits) that were not well founded, but had astonishing consequences, such as the deduction from Newton's law of gravitation that the orbits of the planets are ellipses.

During the 19th century, progress was made towards elaborating precise definitions of the basic concepts of infinitesimal calculus, notably the natural and real numbers. This led to a series of seemingly paradoxical mathematical results near the end of the 19th century that challenged the general confidence in the reliability and truth of mathematical results. This has been called the foundational crisis of mathematics.

The resolution of this crisis involved the rise of a new mathematical discipline called mathematical logic that includes set theory, model theory, proof theory, computability and computational complexity theory, and more recently, parts of computer science. Subsequent discoveries in the 20th century then stabilized the foundations of mathematics into a coherent framework valid for all mathematics. This framework is based on a systematic use of axiomatic method and on set theory, specifically Zermelo–Fraenkel set theory with the axiom of choice. Foundations based on type theory have also gained prevalence, being commonly used in computer proof assistants.

It results from this that the basic mathematical concepts, such as numbers, points, lines, and geometrical spaces are not defined as abstractions from reality but from basic properties (axioms). Their adequation with their physical origins does not belong to mathematics anymore, although their relation with reality is still used for guiding mathematical intuition: physical reality is still used by mathematicians to choose axioms, find which theorems are interesting to prove, and obtain indications of possible proofs.

## Contents

* 1 Ancient Greece
* 2 Before infinitesimal calculus
* 3 Infinitesimal calculus
* 4 19th century
* 4.1 Real analysis
* 4.2 Non-Euclidean geometries
* 4.3 Synthetic vs. analytic geometry
* 4.4 Natural numbers
* 4.5 Infinite sets
* 4.6 Mathematical logic
* 5 Foundational crisis
* 5.1 Philosophical views
* 5.1.1 Formalism
* 5.1.2 Intuitionism
* 5.1.3 Logicism
* 5.1.4 Set-theoretic Platonism
* 5.1.5 Indispensability argument for realism
* 5.1.6 Rough-and-ready realism
* 5.1.7 Philosophical consequences of Gödel's completeness theorem
* 5.2 More paradoxes
* 6 Toward resolution of the crisis
* 7 Non set-theoretic approaches
* 8 See also
* 9 Notes
* 10 References
* 11 External links

## Ancient Greece

Most civilisations developed some mathematics, mainly for practical purposes, such as counting (merchants), surveying (delimitation of fields), prosody, astronomy, and astrology. It seems that ancient Greek philosophers were the first to study the nature of mathematics and its relation with the real world.

Zeno of Elea (c. 490 – c. 430 BC) produced several paradoxes he used to support his thesis that movement does not exist. These paradoxes involve mathematical infinity, a concept that was outside the mathematical foundations of that time and was not well understood before the end of the 19th century.

The Pythagorean school of mathematics originally insisted that the only numbers are natural numbers and ratios of natural numbers. The discovery (c. 5th century BC) that the ratio of the diagonal of a square to its side is not the ratio of two natural numbers was a shock to them which they only reluctantly accepted. A testimony of this is the modern terminology of irrational number for referring to a number that is not the quotient of two integers, since "irrational" means originally "not reasonable" or "not accessible with reason".[lower-alpha 1]

The fact that length ratios are not represented by rational numbers was resolved by Eudoxus of Cnidus (408–355 BC), a student of Plato, who reduced the comparison of two irrational ratios to comparisons of integer multiples of the magnitudes involved. His method anticipated that of Dedekind cuts in the modern definition of real numbers by Richard Dedekind (1831-1916);[2] see Eudoxus of Cnidus § Eudoxus' proportions.

In the Posterior Analytics, Aristotle (384–322 BC) laid down the logic for organizing a field of knowledge by means of primitive concepts, axioms, postulates, definitions, and theorems. Aristotle took a majority of his examples for this from arithmetic and from geometry, and his logic served as the foundation of mathematics for centuries. This method resembles the modern axiomatic method but with a big philosophical difference: axioms and postulates were supposed to be true, being either self-evident or resulting from experiments, while no other truth than the correctness of the proof is involved in the axiomatic method. So, for Aristotle, a proved theorem is true, while in the axiomatic methods, the proof says only that the axioms imply the statement of the theorem.

Aristotle's logic reached its high point with Euclid's Elements (300 BC), a treatise on mathematics structured with very high standards of rigor: Euclid justifies each proposition by a demonstration in the form of chains of syllogisms (though they do not always conform strictly to Aristotelian templates). Aristotle's syllogistic logic, together with its exemplification by Euclid's Elements, are recognized as scientific achievements of ancient Greece, and remained as the foundations of mathematics for centuries.

## Before infinitesimal calculus

During Middle Ages, Euclid's Elements stood as a perfectly solid foundation for mathematics, and philosophy of mathematics concentrated on the ontological status of mathematical concepts; the question was whether they exist independently of perception (realism) or within the mind only (conceptualism); or even whether they are simply names of collection of individual objects (nominalism).

In Elements, the only numbers that are considered are natural numbers and ratios of lengths. This geometrical view of non-integer numbers remained dominant until the end of Middle Ages, although the rise of algebra led to consider them independently from geometry, which implies implicitly that there are foundational primitives of mathematics. For example, the transformations of equations introduced by Al-Khwarizmi and the cubic and quartic formulas discovered in the 16th century result from algebraic manipulations that have no geometric counterpart.

Nevertheless, this did not challenge the classical foundations of mathematics since all properties of numbers that were used can be deduced from their geometrical definition.

In 1637, René Descartes published La Géométrie, in which he showed that geometry can be reduced to algebra by means of coordinates, which are numbers determining the position of a point. This gives to the numbers that he called real numbers a more foundational role (before him, numbers were defined as the ratio of two lengths). Descartes' book became famous after 1649 and paved the way to infinitesimal calculus.

## Infinitesimal calculus

Isaac Newton (1642–1727) in England and Leibniz (1646–1716) in Germany independently developed the infinitesimal calculus for dealing with mobile points (such as planets in the sky) and variable quantities.

This needed the introduction of new concepts such as continuous functions, derivatives and limits. For dealing with these concepts in a logical way, they were defined in terms of infinitesimals that are hypothetical numbers that are infinitely close to zero. The strong implications of infinitesimal calculus on foundations of mathematics is illustrated by a pamphlet of the Protestant philosopher George Berkeley (1685–1753), who wrote "[Infinitesimals] are neither finite quantities, nor quantities infinitely small, nor yet nothing. May we not call them the ghosts of departed quantities?".[3]

Also, a lack of rigor has been frequently invoked, because infinitesimals and the associated concepts were not formally defined (lines and planes were not formally defined either, but people were more accustomed to them). Real numbers, continuous functions, derivatives were not formally defined before the 19th century, as well as Euclidean geometry. It is only in the 20th century that a formal definition of infinitesimals has been given, with the proof that the whole infinitesimal can be deduced from them.

Despite its lack of firm logical foundations, infinitesimal calculus was quickly adopted by mathematicians, and validated by its numerous applications; in particular the fact that the planet trajectories can be deduced from the Newton's law of gravitation.

## 19th century

In the 19th century, mathematics developed quickly in many directions. Several of the problems that were considered led to questions on the foundations of mathematics. Frequently, the proposed solutions led to further questions that were often simultaneously of philosophical and mathematical nature. All these questions led, at the end of the 19th century and the beginning of the 20th century, to debates which have been called the foundational crisis of mathematics. The following subsections describe the main such foundational problems revealed during the 19th century.

### Real analysis

Cauchy (1789–1857) started the project of giving rigorous bases to infinitesimal calculus. In particular, he rejected the heuristic principle that he called the generality of algebra, which consisted to apply properties of algebraic operations to infinite sequences without proper proofs. In his Cours d'Analyse (1821), he considered very small quantities, which could presently be called "sufficiently small quantities"; that is, a sentence such that "if x is very small then ..." must be understood as "there is a (sufficiently large) natural number n such that |x| < 1/n". In the proofs he used this in a way that predated the modern (ε, δ)-definition of limit.[4]

The modern (ε, δ)-definition of limits and continuous functions was first developed by Bolzano in 1817, but remained relatively unknown, and Cauchy probably did know Bolzano's work.

Karl Weierstrass (1815–1897) formalized and popularized the (ε, δ)-definition of limits, and discovered some pathological functions that seemed paradoxical at this time, such as continuous, nowhere-differentiable functions. Indeed, such functions contradict previous conceptions of a function as a rule for computation or a smooth graph.

At this point, the program of arithmetization of analysis (reduction of mathematical analysis to arithmetic and algebraic operations) advocated by Weierstrass was essentially completed, except for two points.

Firstly, a formal definition of real numbers was still lacking. Indeed, beginning with Richard Dedekind in 1858, several mathematicians worked on the definition of the real numbers, including Hermann Hankel, Charles Méray, and Eduard Heine, but this is only in 1872 that two independent complete definitions of real numbers were published: one by Dedekind, by means of Dedekind cuts; the other one by Georg Cantor as equivalence classes of Cauchy sequences.[5]

Several problems were left open by these definitions, which contributed to the foundational crisis of mathematics. Firstly both definitions suppose that rational numbers and thus natural numbers are rigorously defined; this was done a few years later with Peano axioms. Secondly, both definitions involve infinite sets (Dedekind cuts and sets of the elements of a Cauchy sequence), and Cantor's set theory was published several years later.

The third problem is more subtle: and is related to the foundations of logic: classical logic is a first-order logic; that is, quantifiers apply to variables representing individual elements, not to variables representing (infinite) sets of elements. The basic property of the completeness of the real numbers that is required for defining and using real numbers involves a quantification on infinite sets. Indeed, this property may be expressed either as for every infinite sequence of real numbers, if it is a Cauchy sequence, it has a limit that is a real number, or as every subset of the real numbers that is bounded has a least upper bound that is a real number. This need of quantification over infinite sets is one of the motivation of the development of higher-order logics during the first half of the 20th century.

### Non-Euclidean geometries

Before the 19th century, there were many failed attempts to derive the parallel postulate from other axioms of geometry. In an attempt to prove that its negation leads to a contradiction, Johann Heinrich Lambert (1728–1777) started to build hyperbolic geometry and introduced the hyperbolic functions and computed the area of a hyperbolic triangle (where the sum of angles is less than 180°).

Continuing the construction of this new geometry, several mathematicians proved independently that if it is inconsistent, then Euclidean geometry is also inconsistent and thus that the parallel postulate cannot be proved. This was proved by Nikolai Lobachevsky in 1826, János Bolyai (1802–1860) in 1832 and Carl Friedrich Gauss (unpublished).

Later in the 19th century, the German mathematician Bernhard Riemann developed Elliptic geometry, another non-Euclidean geometry where no parallel can be found and the sum of angles in a triangle is more than 180°. It was proved consistent by defining points as pairs of antipodal points on a sphere (or hypersphere), and lines as great circles on the sphere.

These proofs of unprovability of the parallel postulate lead to several philosophical problems, the main one being that before this discovery, the parallel postulate and all its consequences were considered as true. So, the non-Euclidean geometries challenged the concept of mathematical truth.

### Synthetic vs. analytic geometry

Since the introduction of analytic geometry by René Descartes in the 17th century, there were two approaches to geometry, the old one called synthetic geometry, and the new one, where everything is specified in terms of real numbers called coordinates.

Mathematicians did not worry much about the contradiction between these two approaches before the mid-nineteenth century, where there was "an acrimonious controversy between the proponents of synthetic and analytic methods in projective geometry, the two sides accusing each other of mixing projective and metric concepts".[6] Indeed, there is no concept of distance in a projective space, and the cross-ratio, which is a number, is a basic concept of synthetic projective geometry.

Karl von Staudt developed a purely geometric approach to this problem by introducing "throws" that form what is presently called a field, in which the cross ratio can be expressed.

Apparently, the problem of the equivalence between analytic and synthetic approach was completely solved only with Emil Artin's book Geometric Algebra published in 1957. It was well known that, given a field k, one may define affine and projective spaces over k in terms of k-vector spaces. In these spaces, the Pappus hexagon theorem holds. Conversely, if the Pappus hexagon theorem is included in the axioms of a plane geometry, then one can define a field k such that the geometry is the same as the affine or projective geometry over k.

### Natural numbers

The work of making rigorous real analysis and the definition of real numbers, consisted of reducing everything to rational numbers and thus to natural numbers, since positive rational numbers are fractions of natural numbers. There was therefore a need of a formal definition of natural numbers, which imply as axiomatic theory of arithmetic. This was started with Charles Sanders Peirce in 1881 and Richard Dedekind in 1888, who defined a natural numbers as the cardinality of a finite set.[7] However, this involves set theory, which was not formalized at this time.

Giuseppe Peano provided in 1888 a complete axiomatisation based on the ordinal property of the natural numbers. The last Peano's axiom is the only one that induces logical difficulties, as it begin with either "if S is a set then" or "if φ is a predicate then". So, Peano's axioms induce a quantification on infinite sets, and this means that Peano arithmetic is what is presently called a Second-order logic.

This was not well understood at that times, but the fact that infinity occurred in the definition of the natural numbers was a problem for many mathematicians of this time. For example, Henri Poincaré stated that axioms can only be demonstrated in their finite application, and concluded that it is "the power of the mind" which allows conceiving of the indefinite repetition of the same act.[8] This applies in particular to the use of the last Peano axiom for showing that the successor function generates all natural numbers. Also, Leopold Kronecker said "God made the integers, all else is the work of man".[lower-alpha 2] This may be interpreted as "the integers cannot be mathematically defined".

### Infinite sets

Before the second half of the 19th century, infinity was a philosophical concept that did not belong to mathematics. However, with the rise of infinitesimal calculus, mathematicians became accustomed to infinity, mainly through potential infinity, that is, as the result of an endless process, such as the definition of an infinite sequence, an infinite series or a limit. The possibility of an actual infinity was the subject of many philosophical disputes.

Sets, and more specially infinite sets were not considered as a mathematical concept; in particular, there was no fixed term for them. A dramatic change arose with the work of Georg Cantor who was the first mathematician to systematically study infinite sets. In particular, he introduced cardinal numbers that measure the size of infinite sets, and ordinal numbers that, roughly speaking, allow one to continue to count after having reach infinity. One of his major results is the discovery that there are strictly more real numbers than natural numbers (the cardinal of the continuum of the real numbers is greater than that of the natural numbers).

These results were rejected by many mathematicians and philosophers, and led to debates that are a part of the foundational crisis of mathematics.

The crisis was amplified with the Russel's paradox that asserts that the phrase "the set of all sets" is self-contradictory. This contradiction introduced a doubt on the consistency of all mathematics.

With the introduction of the Zermelo–Fraenkel set theory (c. 1925) and its adoption by the mathematical community, the doubt about the consistency was essentially removed, although consistency of set theory cannot be proved because of Gödel's incompleteness theorem.

### Mathematical logic

In 1847, De Morgan published his laws and George Boole devised an algebra, now called Boolean algebra, that allows expressing Aristotle's logic in terms of formulas and algebraic operations. Boolean algebra is the starting point of mathematical logic and the basis of propositional calculus. Independently, in the 1870's, Charles Sanders Peirce and Gottlob Frege extended propositional calculus by introducing quantifiers for building predicate logic.

Frege pointed out three desired properties of a logical theory: consistency (impossibility of proving contradictory statements), completeness (any statement is either provable or refutable; that is, its negation is provable), and decidability (there is a decision procedure to test every statement).

By near the turn of the century, Bertrand Russell popularized Frege's work and discovered Russell's paradox which implies that the phrase "the set of all sets" is self-contradictory. This paradox seemed to make the whole mathematics inconsistent and is one of the major causes of the foundational crisis of mathematics.

## Foundational crisis

The foundational crisis of mathematics arose at the end of the 19th century and the beginning of the 20th century with the discovery of several paradoxes or counter-intuitive results.

The first one was the proof that the parallel postulate cannot be proved. This results from a construction of a non-Euclidean geometry inside Euclidean geometry, whose inconsistency would imply the inconsistency of Euclidean geometry. A well known paradox is Russell's paradox, which shows that the phrase "the set of all sets that do not contain themselves" is self-contradictory. Other philosophical problems were the proof of the existence of mathematical objects that cannot be computed or explicitly described, and the proof of the existence of theorems on natural numbers that cannot be proved with Peano arithmetic (see Gödel's incompleteness theorems).

Several schools of philosophy of mathematics were challenged with these problems in the 20th century, and are described below.

These problems were also studied by mathematicians, and this led to establish mathematical logic as a new area of mathematics, consisting of providing mathematical definitions to logics (sets of inference rules), mathematical and logical theories, theorems, and proofs, and of using mathematical methods to prove theorems about these concepts. The Principia Mathematica is a landmark result in mathematical logic and foundations published by Russell and Alfred North Whitehead in 1913.

Mathematical logic led to unexpected results, such as Gödel's incompleteness theorems, which, roughly speaking, assert that, if a theory contains the standard arithmetic, it cannot be used to prove that it itself is not self-contradictory; and, if it is not self-contradictory, there are theorems that cannot be proved inside the theory, but are nevertheless true in some technical sense.

Zermelo–Fraenkel set theory with the axiom of choice (ZFC) is a logical theory established by Ernst Zermelo and Abraham Fraenkel. It became the standard foundation of modern mathematics, and, unless the contrary is explicitly specified, it is used in all modern mathematical texts, generally implicitly.

Simultaneously, the axiomatic method became a de facto standard: the proof of a theorem must result from explicit axioms and previously proved theorems by the application of clearly defined inference rules. The axioms need not correspond to some reality. Nevertheless, it is an open philosophical problem to explain why the axiom systems that lead to rich and useful theories are those resulting from abstraction from the physical reality or other mathematical theory.

In summary, the foundational crisis is essentially resolved, and this opens new philosophical problems. In particular, it cannot be proved that the new foundation (ZFC) is not self-contradictory. It is a general consensus that, if this would happen, the problem could be solved by a mild modification of ZFC.

### Philosophical views

Main article: Philosophy:Philosophy of mathematics

When the foundational crisis arose, there was much debate among mathematicians and logicians about what should be done for restoring confidence in mathematics. This involved philosophical questions about mathematical truth, the relationship of mathematics with reality, the reality of mathematical objects, and the nature of mathematics.

For the problem of foundations, there were two main options for trying to avoid paradoxes. The first one led to intuitionism and constructivism, and consisted to restrict the logical rules for remaining closer to intuition, while the second, which has been called formalism, considers that a theorem is true if it can be deduced from axioms by applying inference rules (formal proof), and that no "trueness" of the axioms is needed for the validity of a theorem.

#### Formalism

It has been claimed[by whom?] that formalists, such as David Hilbert (1862-1943), hold that mathematics is only a language and a series of games. Hilbert insisted that formalism, called "formula game" by him, is a fundamental part of mathematics, but that mathematics must not be reduced to formalism. Indeed, he used the words "formula game" in his 1927 response to L. E. J. Brouwer's criticisms:

> And to what extent has the formula game thus made possible been successful? This formula game enables us to express the entire thought-content of the science of mathematics in a uniform manner and develop it in such a way that, at the same time, the interconnections between the individual propositions and facts become clear ... The formula game that Brouwer so deprecates has, besides its mathematical value, an important general philosophical significance. For this formula game is carried out according to certain definite rules, in which the technique of our thinking is expressed. These rules form a closed system that can be discovered and definitively stated.[11]

Thus Hilbert is insisting that mathematics is not an arbitrary game with arbitrary rules; rather it must agree with how our thinking, and then our speaking and writing, proceeds.[11]

> We are not speaking here of arbitrariness in any sense. Mathematics is not like a game whose tasks are determined by arbitrarily stipulated rules. Rather, it is a conceptual system possessing internal necessity that can only be so and by no means otherwise.[12]

The foundational philosophy of formalism, as exemplified by David Hilbert, is a response to the paradoxes of set theory, and is based on formal logic. Virtually all mathematical theorems today can be formulated as theorems of set theory. The truth of a mathematical statement, in this view, is represented by the fact 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 "true" mathematical statements (e.g., the laws of arithmetic) appear to be true, and so on. Hermann Weyl posed these very questions to Hilbert:

> What "truth" or objectivity can be ascribed to this theoretic construction of the world, which presses far beyond the given, is a profound philosophical problem. It is closely connected with the further question: what impels us to take as a basis precisely the particular axiom system developed by Hilbert? Consistency is indeed a necessary but not a sufficient condition. For the time being we probably cannot answer this question ...[13]

In some cases these questions may be sufficiently answered through the study of formal theories, in disciplines such as reverse mathematics and computational complexity theory. As noted by Weyl, formal logical systems also run the risk of inconsistency; in Peano arithmetic, this arguably has already been settled with several proofs of consistency, but there is debate over whether or not they are sufficiently finitary 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. 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

Main articles: Intuitionism and Constructivism (mathematics)

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.

The foundational philosophy of intuitionism or constructivism, as exemplified in the extreme by Brouwer and 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 is suspect.

Some modern theories in the philosophy of mathematics deny the existence of foundations in the original sense. Some theories tend to focus on mathematical practice, and aim to describe and analyze the actual working of mathematicians as a social group. Others try to create a cognitive science of mathematics, 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.

#### Logicism

Main article: Logicism

Logicism is a school of thought, and research programme, in the philosophy of mathematics, based on the thesis that mathematics is an extension of logic or that some or all mathematics may be derived in a suitable formal system whose axioms and rules of inference are 'logical' in nature. Bertrand Russell and Alfred North Whitehead championed this theory initiated by Gottlob Frege and influenced by Richard Dedekind.

#### Set-theoretic Platonism

Many researchers in axiomatic set theory have subscribed to what is known as set-theoretic Platonism, exemplified by Kurt Gödel.

Several set theorists followed this approach and actively searched for axioms that may be considered as true for heuristic reasons and that would decide the continuum hypothesis. Many large cardinal axioms were studied, but the hypothesis always remained independent from them and it is now considered unlikely that CH can be resolved by a new large cardinal axiom. Other types of axioms were considered, but none of them has reached consensus on the continuum hypothesis yet. Recent work by Hamkins proposes a more flexible alternative: a set-theoretic multiverse allowing free passage between set-theoretic universes that satisfy the continuum hypothesis and other universes that do not.

#### Indispensability argument for realism

Main article: Philosophy:Quine–Putnam indispensability argument

This argument by Willard Quine and Hilary Putnam says (in Putnam's shorter words),

> ... quantification over mathematical entities is indispensable for science ... therefore we should accept such quantification; but this commits us to accepting the existence of the mathematical entities in question.

However, Putnam was not a Platonist.

#### Rough-and-ready realism

Few mathematicians are typically concerned on a daily, working basis over logicism, formalism or any other philosophical position. Instead, their primary concern is that the mathematical enterprise as a whole always remains productive. Typically, they see this as ensured by remaining open-minded, practical and busy; as potentially threatened by becoming overly-ideological, fanatically reductionistic or lazy.

Such a view has also been expressed by some well-known physicists.

For example, Richard Feynman said

> People say to me, "Are you looking for the ultimate laws of physics?" No, I'm not ... If it turns out there is a simple ultimate law which explains everything, so be it – that would be very nice to discover. If it turns out it's like an onion with millions of layers ... then that's the way it is. But either way there's Nature and she's going to come out the way She is. So therefore when we go to investigate we shouldn't predecide what it is we're looking for only to find out more about it.[14]

And Steven Weinberg:[15]

> The insights of philosophers have occasionally benefited physicists, but generally in a negative fashion – by protecting them from the preconceptions of other philosophers. ... without some guidance from our preconceptions one could do nothing at all. It is just that philosophical principles have not generally provided us with the right preconceptions.

Weinberg believed that any undecidability in mathematics, such as the continuum hypothesis, could be potentially resolved despite the incompleteness theorem, by finding suitable further axioms to add to set theory.

#### Philosophical consequences of Gödel's completeness theorem

Main article: Gödel's completeness theorem

Gödel's completeness theorem establishes an equivalence in first-order logic between the formal provability of a formula and its truth in all possible models. Precisely, for any consistent first-order theory it gives an "explicit construction" of a model described by the theory; this model will be countable if the language of the theory is countable. However this "explicit construction" is not algorithmic. It is based on an iterative process of completion of the theory, where each step of the iteration consists in adding a formula to the axioms if it keeps the theory consistent; but this consistency question is only semi-decidable (an algorithm is available to find any contradiction but if there is none this consistency fact can remain unprovable).

### More paradoxes

See also: List of statements independent of ZFC and List of paradoxes

The following lists some notable results in metamathematics. Zermelo–Fraenkel set theory is the most widely studied axiomatization of set theory. It is abbreviated ZFC when it includes the axiom of choice and ZF when the axiom of choice is excluded.

* 1920: Thoralf Skolem corrected Leopold Löwenheim's proof of what is now called the downward Löwenheim–Skolem theorem, leading to Skolem's paradox discussed in 1922, namely the existence of countable models of ZF, making infinite cardinalities a relative property.
* 1922: Proof by Abraham Fraenkel that the axiom of choice cannot be proved from the axioms of Zermelo set theory with urelements.
* 1931: Publication of Gödel's incompleteness theorems, showing that essential aspects of Hilbert's program could not be attained. It showed how to construct, for any sufficiently powerful and consistent recursively axiomatizable system - such as necessary to axiomatize the elementary theory of arithmetic on the (infinite) set of natural numbers - a statement that formally expresses its own unprovability, which he then proved equivalent to the claim of consistency of the theory; so that (assuming the consistency as true), the system is not powerful enough for proving its own consistency, let alone that a simpler system could do the job. It thus became clear that the notion of mathematical truth cannot be completely determined and reduced to a purely formal system as envisaged in Hilbert's program. 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).
* 1936: Alfred Tarski proved his truth undefinability theorem.
* 1936: Alan Turing proved that a general algorithm to solve the halting problem for all possible program-input pairs cannot exist.
* 1938: Gödel proved the consistency of the axiom of choice and of the generalized continuum hypothesis.
* 1936–1937: Alonzo Church and Alan Turing, respectively, published independent papers showing that a general solution to the Entscheidungsproblem is impossible: the universal validity of statements in first-order logic is not decidable (it is only semi-decidable as given by the completeness theorem).
* 1955: Pyotr Novikov showed that there exists a finitely presented group G such that the word problem for G is undecidable.
* 1963: Paul Cohen showed that the Continuum Hypothesis is unprovable from ZFC. Cohen's proof developed the method of forcing, which is now an important tool for establishing independence results in set theory.
* 1964: Inspired by the fundamental randomness in physics, Gregory Chaitin starts publishing results on algorithmic information theory (measuring incompleteness and randomness in mathematics).[16]
* 1966: Paul Cohen showed that the axiom of choice is unprovable in ZF even without urelements.
* 1970: Hilbert's tenth problem is proven unsolvable: there is no recursive solution to decide whether a Diophantine equation (multivariable polynomial equation) has a solution in integers.
* 1971: Suslin's problem is proven to be independent from ZFC.

## Toward resolution of the crisis

Starting in 1935, the Bourbaki group of French mathematicians started publishing a series of books to formalize many areas of mathematics on the new foundation of set theory.

The intuitionistic school did not attract many adherents, and it was not until Bishop's work in 1967 that constructive mathematics was placed on a sounder footing.[17]

One may consider that Hilbert's program has been partially completed, so that the crisis is essentially resolved, satisfying ourselves with lower requirements than Hilbert's original ambitions. His ambitions were expressed in a time when nothing was clear: it was not clear whether mathematics could have a rigorous foundation at all.

There are many possible variants of set theory, which differ in consistency strength, where stronger versions (postulating higher types of infinities) contain formal proofs of the consistency of weaker versions, but none contains a formal proof of its own consistency. Thus the only thing we do not have is a formal proof of consistency of whatever version of set theory we may prefer, such as ZF. There have been other philosophical justifications for the consistency of a formal system, such as Gentzen's consistency proof which reduces the consistency of the Peano axioms to the weaker system of Primitive recursive arithmetic with an additional axiom asserting the existence of a certain ordinal number. This proof also started a program of similar ordinal analysis for other formal systems.[18]

In practice, 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 incompleteness and paradoxes of the underlying formal theories never played a role anyway, and in those branches in which they do or whose formalization attempts would run the risk of forming inconsistent theories (such as logic and category theory), they may be treated carefully.

The development of category theory in the middle of the 20th century showed the usefulness of set theories guaranteeing the existence of larger classes than does ZFC, such as Von Neumann–Bernays–Gödel set theory or Tarski–Grothendieck set theory, albeit that in very many cases the use of large cardinal axioms or Grothendieck universes is formally eliminable.

One goal of the reverse mathematics program is to identify whether there are areas of "core mathematics" in which foundational issues may again provoke a crisis. This involves checking to see if formal systems that are weaker than ZFC can prove mathematical theorems.

## Non set-theoretic approaches

Approaches to the foundations of mathematics that are not based on set theory have also been researched and adopted. Type theory has been used as a basis for mathematical foundations, such as in the calculus of constructions, or intuitionistic type theory, which was first published by Per Martin-Löf in 1975.[19] Univalent foundations are a newer approach to mathematical foundations originating in the 2000s which is built from homotopy type theory. Type theoretic foundations have become more common than set-theoretic ones for use in proof assistants, which are computer programs that assist in the development and verification of formal mathematical proofs.

Roughly speaking, type theory does not need "axioms" in the traditional sense, but instead has a more comprehensive system of logic which serves the same purpose. This can make it harder to compare consistency strength of a type theory to a set theory, but this has been attempted. For example, Benjamin Werner showed it was possible to encode Zermelo-Fraenkel set theory by using the calculus of inductive constructions as a metatheory, and vice versa assuming the existence of infinite inaccessible cardinals.[20]

Certain category theory objects called topoi have also been used as a basis for math foundations.

## See also

* Aristotelian realist philosophy of mathematics
* Mathematical logic
* Brouwer–Hilbert controversy
* Church–Turing thesis
* Controversy over Cantor's theory
* Epistemology
* Euclid's Elements
* Hilbert's problems
* Implementation of mathematics in set theory
* Liar paradox
* New Foundations
* Philosophy of mathematics
* Principia Mathematica
* Quasi-empiricism in mathematics
* Mathematical thought of Charles Peirce

## Notes

1. ↑ See Rational number § Etymology for this unusual terminology: "ratio" is derived from "rational", which is itself derived from "irrational".
2. ↑ The English translation is from Gray. In a footnote, Gray attributes the German quote to: "Weber 1891–1892, 19, quoting from a lecture of Kronecker's of 1886."[9][10]

1. ↑ Joachim Lambek (2007), "Foundations of mathematics", Encyclopædia Britannica
2. ↑ The thirteen books of Euclid's Elements, edited by Sir Thomas Heath. 2 (Book V). New York: Dover Publications. 1956. pp. 124–126. ISBN 0-486-60089-0. https://archive.org/details/thirteenbookseu00heibgoog/page/n136/mode/2up.
3. ↑ The Analyst, A Discourse Addressed to an Infidel Mathematician
4. ↑ Grabiner, Judith V. (1983), "Who Gave You the Epsilon? Cauchy and the Origins of Rigorous Calculus", American Mathematical Monthly 90 (3): 185–194, doi:10.2307/2975545 , collected in Who Gave You the Epsilon?, ISBN 978-0-88385-569-0 pp. 5–13. Also available at: http://www.maa.org/pubs/Calc_articles/ma002.pdf
5. ↑ O'Connor, John J.; Robertson, Edmund F. (October 2005), "The real numbers: Stevin to Hilbert", MacTutor History of Mathematics archive, University of St Andrews, http://www-history.mcs.st-andrews.ac.uk/HistTopics/Real_numbers_2.html .
6. ↑ Laptev, B.L. & B.A. Rozenfel'd (1996) Mathematics of the 19th Century: Geometry, page 40, Birkhäuser ISBN 3-7643-5048-2
7. ↑ Dedekind, Richard. What Are and What Should the Numbers Be? Continuity and Irrational Numbers. Springer. ISBN 978-3-662-70059-4.
8. ↑ Poincaré, Henri (1905). "On the nature of mathematical reasoning". La Science et l'hypothèse. VI. https://en.wikisource.org/wiki/Science_and_Hypothesis/Chapter_1.
9. ↑ Plato's Ghost: The modernist transformation of mathematics. Princeton University Press. 2008. p. 153. ISBN 978-1-4008-2904-0. https://books.google.com/books?id=ldzseiuZbsIC&q="God+made+the+integers,+all+else+is+the+work+of+man.".
10. ↑ Weber, Heinrich L. (1891–1892). "Kronecker". Jahresbericht der Deutschen Mathematiker-Vereinigung. pp. 2:5–23. (The quote is on p. 19). http://www.digizeitschriften.de/dms/img/?PPN=PPN37721857X_0002&DMDID=dmdlog6; "access to Jahresbericht der Deutschen Mathematiker-Vereinigung". http://www.digizeitschriften.de/dms/toc/?PPN=PPN37721857X_0002.
11. ↑ 11.0 11.1 Hilbert 1927 The Foundations of Mathematics in van Heijenoort 1967:475
12. ↑ p. 14 in Hilbert, D. (1919–20), Natur und Mathematisches Erkennen: Vorlesungen, gehalten 1919–1920 in Göttingen. Nach der Ausarbeitung von Paul Bernays (Edited and with an English introduction by David E. Rowe), Basel, Birkhauser (1992).
13. ↑ Weyl 1927 Comments on Hilbert's second lecture on the foundations of mathematics in van Heijenoort 1967:484. Although Weyl the intuitionist believed that "Hilbert's view" would ultimately prevail, this would come with a significant loss to philosophy: "I see in this a decisive defeat of the philosophical attitude of pure phenomenology, which thus proves to be insufficient for the understanding of creative science even in the area of cognition that is most primal and most readily open to evidence - mathematics" (ibid).
14. ↑ Richard Feynman, The Pleasure of Finding Things Out p. 23
15. ↑ Steven Weinberg, chapter Against Philosophy wrote, in Dreams of a final theory
16. ↑ Chaitin, Gregory (2006), "The Limits Of Reason", Scientific American 294 (3): 74–81, doi:10.1038/scientificamerican0306-74, PMID 16502614, Bibcode: 2006SciAm.294c..74C, https://www.cs.auckland.ac.nz/~chaitin/sciamer3.pdf, retrieved 2016-02-22
17. ↑ Andrej Bauer (2017), "Five stages of accepting constructive mathematics", Bull. Amer. Math. Soc. 54 (3): 485, doi:10.1090/bull/1556
18. ↑ Rathjen, Michael; Sieg, Wilfried (Feb 21, 2024). "Proof Theory, "Gentzen’s Consistency Proof"". in Zalta, Edward N.; Nodelman, Uri. https://plato.stanford.edu/entries/proof-theory/#GentConsProo.
19. ↑ Martin-Löf, Per (1998). An intuitionistic theory of types, Twenty-five years of constructive type theory (Venice,1995). Oxford Logic Guides. 36. New York: Oxford University Press. pp. 127–172.
20. ↑ Werner, Benjamin (1997). Abadi, Martín; Ito, Takayasu. eds. "Sets in types, types in sets" (in en). Theoretical Aspects of Computer Software (Berlin, Heidelberg: Springer): 530–546. doi:10.1007/BFb0014566. ISBN 978-3-540-69530-1. https://link.springer.com/chapter/10.1007/BFb0014566?error=cookies_not_supported&code=0d3e516f-66bf-48f7-a8e1-21773cfd71e0.

## References

* Avigad, Jeremy (2003) Number theory and elementary arithmetic, Philosophia Mathematica Vol. 11, pp. 257–284
* Eves, Howard (1990), Foundations and Fundamental Concepts of Mathematics Third Edition, Dover Publications, INC, Mineola NY, ISBN 0-486-69609-X (pbk.) cf §9.5 Philosophies of Mathematics pp. 266–271. Eves lists the three with short descriptions prefaced by a brief introduction.
* Goodman, N.D. (1979), "Mathematics as an Objective Science", in Tymoczko (ed., 1986).
* Hart, W.D. (ed., 1996), The Philosophy of Mathematics, Oxford University Press, Oxford, UK.
* Hersh, R. (1979), "Some Proposals for Reviving the Philosophy of Mathematics", in (Tymoczko 1986).
* Hilbert, D. (1922), "Neubegründung der Mathematik. Erste Mitteilung", Hamburger Mathematische Seminarabhandlungen 1, 157–177. Translated, "The New Grounding of Mathematics. First Report", in (Mancosu 1998).
* Katz, Robert (1964), Axiomatic Analysis, D. C. Heath and Company.
* Kleene, Stephen C. (1991). Introduction to Meta-Mathematics (Tenth impression 1991 ed.). Amsterdam NY: North-Holland Pub. Co. ISBN 0-7204-2103-9.

In Chapter III A Critique of Mathematic Reasoning, §11. The paradoxes, Kleene discusses Intuitionism and Formalism in depth. Throughout the rest of the book he treats, and compares, both Formalist (classical) and Intuitionist logics with an emphasis on the former. Extraordinary writing by an extraordinary mathematician.

* Mancosu, P. (ed., 1998), From Hilbert to Brouwer. The Debate on the Foundations of Mathematics in the 1920s, Oxford University Press, Oxford, UK.
* Putnam, Hilary (1967), "Mathematics Without Foundations", Journal of Philosophy 64/1, 5–22. Reprinted, pp. 168–184 in W.D. Hart (ed., 1996).
* —, "What is Mathematical Truth?", in Tymoczko (ed., 1986).
* Sudac, Olivier (Apr 2001). "The prime number theorem is PRA-provable". Theoretical Computer Science 257 (1–2): 185–239. doi:10.1016/S0304-3975(00)00116-X.
* Troelstra, A. S. (no date but later than 1990), "A History of Constructivism in the 20th Century", A detailed survey for specialists: §1 Introduction, §2 Finitism & §2.2 Actualism, §3 Predicativism and Semi-Intuitionism, §4 Brouwerian Intuitionism, §5 Intuitionistic Logic and Arithmetic, §6 Intuitionistic Analysis and Stronger Theories, §7 Constructive Recursive Mathematics, §8 Bishop's Constructivism, §9 Concluding Remarks. Approximately 80 references.
* Tymoczko, T. (1986), "Challenging Foundations", in Tymoczko (ed., 1986).
* —,(ed., 1986), New Directions in the Philosophy of Mathematics, 1986. Revised edition, 1998.
* van Dalen D. (2008), "Brouwer, Luitzen Egbertus Jan (1881–1966)", in Biografisch Woordenboek van Nederland. URL:http://www.inghist.nl/Onderzoek/Projecten/BWN/lemmata/bwn2/brouwerle [2008-03-13]
* Weyl, H. (1921), "Über die neue Grundlagenkrise der Mathematik", Mathematische Zeitschrift 10, 39–79. Translated, "On the New Foundational Crisis of Mathematics", in (Mancosu 1998).
* Wilder, Raymond L. (1952), Introduction to the Foundations of Mathematics, John Wiley and Sons, New York, NY.

## External links

* "Philosophy of mathematics". Internet Encyclopedia of Philosophy. http://www.iep.utm.edu/category/s-l-m/math/.
* Logic and Mathematics
* Harvey M. Friedman, Foundations of Mathematics: past, present, and future, May 31, 2000, 8 pages.
* A Century of Controversy over the Foundations of Mathematics by Gregory Chaitin.

* v
* t
* e

Mathematical logic

General|

* Formal language
* Formation rule
* Formal proof
* Formal semantics
* Well-formed formula
* Set
* Element
* Class
* Classical logic
* Axiom
* Rule of inference
* Relation
* Theorem
* Logical consequence
* Type theory
* Symbol
* Syntax
* Theory

Systems|

* Formal system
* Deductive system
* Axiomatic system
* Hilbert style systems
* Natural deduction
* Sequent calculus

Traditional logic|

* Proposition
* Inference
* Argument
* Validity
* Cogency
* Syllogism
* Square of opposition
* Venn diagram

Propositional calculus
and Boolean logic

* Boolean functions
* Propositional calculus
* Propositional formula
* Logical connectives
* Truth tables
* Many-valued logic

Predicate logic|

* First-order
* Quantifiers
* Predicate
* Second-order
* Monadic predicate calculus

Naive set theory|

* Set
* Empty set
* Element
* Enumeration
* Extensionality
* Finite set
* Infinite set
* Subset
* Power set
* Countable set
* Uncountable set
* Recursive set
* Domain
* Codomain
* Image
* Map
* Function
* Relation
* Ordered pair

Set theory|

* Foundations of mathematics
* Zermelo–Fraenkel set theory
* Axiom of choice
* General set theory
* Kripke–Platek set theory
* Von Neumann–Bernays–Gödel set theory
* Morse–Kelley set theory
* Tarski–Grothendieck set theory

Model theory|

* Model
* Interpretation
* Non-standard model
* Finite model theory
* Truth value
* Validity

Proof theory|

* Formal proof
* Deductive system
* Formal system
* Theorem
* Logical consequence
* Rule of inference
* Syntax

Computability
theory|

* Recursion
* Recursive set
* Recursively enumerable set
* Decision problem
* Church–Turing thesis
* Computable function
* Primitive recursive function

* v
* t
* e

Areas of mathematics

Foundations|

* Category theory
* Information theory
* Mathematical logic
* Philosophy of mathematics
* Set theory

Algebra|

* Abstract
* Elementary
* Linear
* Multilinear
* Universal

Analysis|

* Calculus
* Real analysis
* Complex analysis
* Differential equations
* Functional analysis
* Harmonic analysis

Discrete|

* Combinatorics
* Graph theory
* Order theory
* Game theory

Geometry|

* Algebraic
* Analytic
* Differential
* Discrete
* Euclidean
* Finite

Number theory|

* Arithmetic
* Algebraic number theory
* Analytic number theory
* Diophantine geometry

Topology|

* Algebraic
* Differential
* Geometric

Applied|

* Control theory
* Mathematical biology
* Mathematical chemistry
* Mathematical economics
* Mathematical finance
* Mathematical physics
* Mathematical psychology
* Mathematical statistics
* Probability
* Statistics

Computational|

* Computer science
* Theory of computation
* Numerical analysis
* Optimization
* Computer algebra

Others|

* History of mathematics
* Recreational mathematics
* Mathematics and art
* Mathematics education

* Category
* Portal
* Commons
* WikiProject

Template:Foundations-footer

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Foundations of mathematics. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Philosophy:Foundations_of_mathematics&oldid=4356625"
*[c.]: circa
*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template