Speaker: Elena Y. Nogina, BMCC, The City University of New York
Title: Reflection Principles Involving Provability and Explicit Proofs
Abstract:
Reflection Principles are classical objects in proof theory and the areas studying Gödel Incompleteness. Reflection principles based on provability predicates were introduced in the 1930s by Rosser and Turing, and later were explored by Feferman, Kreisel & Levi, Schmerl, Artemov, Beklemishev and others.
We study reflection principles of Peano Arithmetic based on both Proof and Provability predicates. We find a classification of these principles and establish their linear ordering with respect to their deductive strength in PA.