Satisfaction Classes and Recursive Saturation III
Michał Tomasz Godziszewski
The study of possible semantics for arithmetized languages in nonstandard models has been a lively research field since the seminal paper of A. Robinson “On languages based on non-standard arithmetic”. Our primary inspiration for examining mathematical features of such structures, and recursively saturated in particular, is that every countable recursively saturated model of Peano Arithmetic supports a great variety of nonstandard satisfaction classes that can serve as models for formal theories of truth – those models allow to investigate the role of arithmetic induction in semantic considerations. On the other hand, nonstandard satisfaction classes are used as a tool in model theoretic constructions providing answers to questions in the model theory of formal arithmetic and often make it possible to solve problems that do not explicitly involve nonstandard semantics. In the series of talks, I will present proofs of classical results concerning satisfaction classes and recursive saturation in models of PA.
Michał Tomasz Godziszewski is visiting CUNY from September 2016 until March 2017.