Wednesday, December 3, 20144:50 pmModels of PAGC 6300

Bounded Second-Order Arithmetic I

Shlomo Ben-Har


Shlomo Ben-Har

We will discuss axiom systems for weak second order arithmetic. In the study of bounded arithmetic, the base theory is called V^0; we will discuss coding and counting in V^0 and in an extension of it. We will give at least one example of a sentence that is not provable in V^0 but is provable in the extension.