Mathematical logic and foundations Definition
Formalism
Definition
Formalism is a position in the foundations of mathematics. It holds that mathematical statements are strings of symbols in a formal system. A statement is established when it is derived from the axioms of the system by its rules of inference. The derivation is the whole content of a proof, and a statement need not refer to abstract objects.
Remarks
In a formal system for arithmetic, the string is established by a derivation from the axioms; a formalist accepts it for that reason alone. Some statements are true in the standard natural numbers but have no derivation in the system. An example is a Gödel sentence of the incompleteness theorems, and formalism does not count it as established. Hilbert's version of formalism kept a contentful core of finitary mathematics. It treated the rest as a formal system whose consistency should be proved by finitary means; this is Hilbert's program.
Reading path
To understand this page from the ground up, read these 6 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Foundations of mathematics concept
- Proposition concept
- Implication definition
- Modus ponens concept
- Mathematical proof concept
- Formalism definition
Further reading
About this page
| Tag | N1N5N2QJ86 |
|---|---|
| URI | m2://N1N5N2QJ86 |
| Kind | definition |
| Writing | W0 stub |
| MSC | 03A05 |
| Defines | Formalism |
| Uses | Foundations of mathematics, Mathematical proof |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.