Unprovability in Mathematics: A First Course on Ordinal Analysis
From MaRDI portal
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Foundations of classical theories (including reverse mathematics) (03B30) Cut-elimination and normal-form theorems (03F05) Recursive ordinals and ordinal notations (03F15) Second- and higher-order arithmetic and fragments (03F35) Gödel numberings and issues of incompleteness (03F40)
Abstract: These are the lecture notes of an introductory course on ordinal analysis. Our selection of topics is guided by the aim to give a complete and direct proof of a mathematical independence result: Kruskal's theorem for binary trees is unprovable in conservative extensions of Peano arithmetic (note that much stronger results of this type are due to Harvey Friedman). Concerning prerequisites, we assume a solid introduction to mathematical logic but no specialized knowledge of proof theory. The material in these notes is intended for 12 lectures and 6 exercise sessions of 90 minutes each.
This page was built for publication: Unprovability in Mathematics: A First Course on Ordinal Analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6377576)
