Formalism
Formalism is a philosophy of mathematics, which holds that math is just a game of formal symbol manipulation.
Formalism has the same flavor as subjectivism.
Formalism is one of the three major philosophies which dominate the minds of modern mathematics, the others being Intuitionism and Platonism. Very few working mathematicians adhere consistently to any of those three philosophies. Almost all of them tacitly accept the (mutually inconsistent) premises of all three.
Many formalists are only formalists with respect to some parts of math. This includes most working mathematicians, insofar as they hold formalist premises. For example, Hilbert held[1] that finite math is meaningful, but infinite math is just a game of formal symbol manipulation.
For a good example of explicit formalism, see the following quote from Russel and Whitehead[2] about definitions
A definition is a declaration that a certain newly-introduced symbol or combination of symbols is to mean the same as a certain other combination of symbols of which the meaning is already known. [...] We will give the names of definiendum and definiens respectively to what is defined and to that which is defined as its meaning. [...]
[...]
It is to be observed that a definition is, strictly speaking, no part of the subject in which it occurs. For a definition is concerned wholly with the symbols, not with what they symbolize. Moreover it is not true or false, being the expression of a volition, not of a proposition. [...] Theoretically, it is unnecessary ever to give a definition: we might always use the definiens instead, and thus wholly dispense with the definiendum. Thus [...] definitions are no part of our subject, but are, strictly speaking, mere typographical conveniences. Practically, of course, if we introduced no definitions, our formulae would very soon become so lengthy as to be unmanageable; but theoretically, all definitions are superfluous.
[TODO maybe add something to this page about Wittgenstein? or maybe not cuz so few ppl are wittgensteinians...]
Logicism
Logicism is a specific type of formalism, which believes that the rules and concepts of the game are reducible to those of logic (sets, set membership, modus ponens, etc). Logic here refers to logic as understood by Frege, rather than logic as understood by e.g. Aristotle.
For example, Logicism defines the natural numbers to be set-theoretic objects like the following
etc.
Examples
Here I will put examples of working mathematicians saying things based on a formalist premise.
The working mathematician almost always has some formalist premises. To some extent, he treats some pieces of math like a game of formal symbol manipulation. However, it is difficult to identify if, in any specific instance, a mathematician is being a formalist. The reason for this is that what is understood by one man as a conceptual argument, could be understood by another man as mere symbol manipulation.
The following example is from Gamelin and Greene, Introduction to Topology[3]:
3.1 Theorem: Let and be topological spaces. A function is continuous if and only if is continuous at every point of .
Proof: Suppose that is continuous at every point of and that is open in . Let . Since is continuous at , there is an open set containing such that , or . Set . Then is open and , so that . Since includes each point of , coincides with and is open. Thus is continuous.
Conversely, suppose that is continuous. Let and let be an open set containing . Then is an open set containing and . Consequently is continuous at for all .
The reason why I say that this proof is formalistic is that it could be easily understood by someone who knows the formal definitions of the objects involved in the proof, but has no conceptual understanding of what it means for a map to be continuous. Indeed, that situation is the case for many students who are learning about topology for the first time. Although more advanced mathematicians have at least some level of intuitive (non-formalistic) understanding of why these two definitions of continuity are equivalent, that is neither necessary nor sufficient for proving the above theorem.
Whenever you have a proof or a definition that is super formal, that uses the technicalities of the definitions rather than explanations, there's probably a formalist definition lurking around somewhere.
Refutations
Mathematicians usually don't actually do deductions.
[TODO explain] Gödel refuted formalism, as it was understood by Hilbert's program.
References
- ↑ Brown, James R. Philosophy of Mathematics: An Introduction to the World of Proofs and Pictures. 1st ed., Routledge, 1999.
- ↑ Whitehead, Alfred North; Russell, Bertrand (1925). Principia Mathematica. Vol. 1 (2nd ed.). Cambridge: Cambridge University Press.
- ↑ Gamelin, Theodore W, and Robert Everist Greene. Introduction to Topology. Saunders College Publishing, 1983.