3 Review(s)

This volume focuses on the role of set existence axioms. Part A demonstrates that many familiar theorems of algebra, analysis, functional analysis, and combinatorics are logically equivalent to the axioms needed to prove them. This phenomenon is known as reverse mathematics. Subsystems of second order arithmetic based on such axioms correspond to several foundational programs: finitistic reductionism (Hilbert); constructivism (Bishop); predictavism (Weyl); and predictive reductionism (Feferman/Friedman). Part B is a thorough study of models of these and other systems.