- Bourbaki - Structuralism
- Brower - Intuitionism
- Frege - Logicism (?)
- Gödel - Platonism
- Hilbert - Formalism
- Lakatos - Proofs and refutations in the tradition of Popper
- J. S. Mill - Math as empirical generalization
- Poincare - Intuitionism (?)
- Russell - Logicism
- Wittgenstein - Constructivism (?)

Philosophers of math often discuss various interesting bits of mathematics. These include the construction of real numbers as equivalence classes of Cauchy-convergent sequences of rationals, of rational numbers as equivalence classes of ordered pairs of integers, and of integers as functions mapping (subsets of) the natural numbers to the natural numbers. Each construction comes with definitions of <, +, and *. The notion of an isomorphism is important in these constructions.

Those who think mathematics is in need of a foundation have often looked for one in terms of logic and set theory. Different axiom systems have been offered for sets. Russell's theory of types contrasts with the Zermelo-Fraenkel (ZF) system. In these set theories, there is an infinity of orders of infinity. I've always like the proof that the power set of a set, that is, the set of all subsets of a set, cannot be put in a one-to-one relationship with the original set. Thinking about applying that theorem recursively to the set of the natural numbers soon exhausts my imagination. Someday I would like to understand Gödel's proofs that if ZF is consistent, then ZP with the axiom of choice (ZFC) is consistent. And if ZFC is consistent, then Cantor's continuum hypothesis is consistent with ZFC. Paul Cohen went further. He proved, in 1963, the continuum hypothesis is independent of the axioms of ZFC. I guess this relates to model theory. I gather the Löwenheim-Skolem theorem is a surprising result.

Philosophers of mathematics often discuss certain important results from comutability theory and the theory of automata. Among these are Gödel's imcompleteness theorem. (Barkley Rosser, Sr., generalized Gödel’s work, from ω-consistency to consistency.) I gather the unsolvability of Diophantine equations, in general, follows from Gödel's theorem. The existence of uncomputable functions is of interest. Every computer programmer should be aware of the halting problem. I find interesting the Church-Turing thesis, the Chomsky hierarchy, and the question of whether the set of problems that can be solved in polynomial time by a deterministic Turing machine is equivalent to the set of problems that can be solved in polynomial time by a nondeterministic Turing machine.

## 3 comments:

It's good to see you post this, since you have hinted that you see some non-superficial parallels between foundational issues in maths and economics.

Some quibbles, points and subjective reactions:

* On your "thinkers list": Russell also contributed type theory (along with Alonzo Church), which has been a fertile stream marrying with structuralism (esp. Lawverian algebra) and constructivism (through Bishop & Martin-Loef). Lakatos' school is sometimes called "quasi-empiricist", and I don't suppose that Mill really had all that much lasting influence. I don't think that either Poincare can Wittgenstein can really be directly associated with much other than anti-foundationalist criticism, although W certainly has had a big indirect influence through Dummett on intuitionism. I certainly wouldn't call Poincare an intuitionist.

* Hilbert's 10th problem, solvability of Diophantines, certainly wasn't settled by Goedel's theorem or its refinements, though some techniques Goedel originated were essential to Matiyasevich's counterexample.

* I should probably stop recommending unwanted reading, but you may find David Corfield's book,

Towards a Philosophy of Real Mathematicsvery interesting and agreeable if you did read it, especially on Lakatos and the relationship between the philosophy and practice of mathematics.Thanks for the comment, Charles. I realize you know much more about set theory, logic, and the philosophy of mathematics than I will ever know.

I've been surprised to find some writing about computability and economics. In addition to Mirowski, Kumaraswamy Velupillai is intriguing. (I did not check that the download button in that link works.)

I realize that anybody interested in an academic discipline will have a reading list that grows, not shrinks. Given the excerpt available on-line, I might order that.

Thanks, Robert, for the kind comments. Velupillai's collection does, indeed, look interesting.

An afterthought: Wittgenstein's philosophy has repeatedly been described as ultrafinitist, cf. [1]

[1] http://en.wikipedia.org/wiki/Ultrafinitism

Post a Comment