This is the abstract of my 1-hour plenary talk at a conference on Computability, Reverse Mathematics and Combinatorics, held at Banff, Alberta, Canada, December 7-12, 2008.
The Gödel Hierarchy is an array of foundationally significant theories in the predicate calculus. The theories range from weak (bounded arithmetic, elementary function arithmetic) through intermediate (subsystems of second-order arithmetic), through strong (Zermelo/Fraenkel set theory, large cardinals). The theories are ordered by inclusion, interpretability, and consistency strength. Reverse Mathematics is a program which seeks to classify mathematical theorems by calibrating their places within the Gödel Hierarchy. The theorems are drawn from core mathematical areas such as analysis, algebra, functional analysis, topology, and combinatorics. Remarkably, the Reverse Mathematics classification scheme exhibits a considerable amount of regularity and structure. In particular, a large number of core mathematical theorems fall into a small number of foundationally significant equivalence classes (the so-called ``big five''). There are close connections with other foundational programs and hierarchies. In particular, concepts and methods from degrees of unsolvability play an important role.
This document was generated using the LaTeX2HTML translator Version 2002-2-1 (1.71)
Copyright © 1993, 1994, 1995, 1996,
Nikos Drakos,
Computer Based Learning Unit, University of Leeds.
Copyright © 1997, 1998, 1999,
Ross Moore,
Mathematics Department, Macquarie University, Sydney.
The command line arguments were:
latex2html -split 0 abstract.tex
The translation was initiated by Stephen G Simpson on 2008-12-10