Toronto Set Theory Seminar
Friday, April 15 from 1:30 to 3pm
Fields Institute, Room 210
Speaker: Harvey Friedman (Ohio State)
Title: Concrete mathematical incompleteness
An unprovable theorem is a theorem about basic mathematical objects that can only be proved using more than the usual axioms for mathematics (ZFC = Zermelo Frankel set theory with the Axiom of Choice) – and that has been proved using standard extensions of ZFC generally adopted by the mathematical logic community.
The highlight of the talk is the presentation of unprovable theorems stated in terms of self embeddings of maximal cliques in graphs.
We first review some previous examples of unprovable theorems. 1-5 are unprovable in the weaker sense that any proof demonstrably requires some use of logical principles transcendental to the problem statement. 6 is BRT (Boolean Relation Theory).
1. Patterns in finite sequences from a finite alphabet.
2. Pointwise continuous embeddings between countable sets of reals (or more concretely, rationals).
3. Relations between f(n_1,…,n_k) and f(n_2,…,n_k+1).
4. Homeomorphic embeddings between finite trees.
5. Borel sets in the plane and graphs of one dimensional Borel functions.
6. Boolean relations between sets of integers and their images under integer functions.