Satisfaction classes and automorphisms of models of PA
This is a survey paper. Its goal is twofold. The first goal is to present the following problem: determine what part of the model theory of countable recursively saturated models of Peano arithmetic PA can be obtained as corollaries of classical results concerning models of extensions of PA applied to structures of the type \((M,S)\), where \(M\) is a recursively saturated model of PA and \(S\) is an inductive satisfaction class for \(M\). The second goal is to present examples of results in the model theory of recursively saturated models of PA obtained easily by using satisfaction classes. For the entire collection see [Zbl 0893.00029].
- Full satisfaction classes: A survey
- Four problems concerning recursively saturated models of arithmetic
- Full satisfaction classes, definability, and automorphisms
- A note on satisfaction classes
- Satisfaction classes via cut elimination
- A note on the variety of satisfaction classes
- More on induction in the language with a satisfaction class
- scientific article; zbMATH DE number 32280 (Why is no real title available?)
- GAME APPROXIMATIONS OF SATISFACTION CLASSES MODELS
- ITERATIONS OF SATISFACTION CLASSES AND MODELS OF PEANO ARITHMETIC
- scientific article; zbMATH DE number 663792 (Why is no real title available?)
- Cofinal elementary extensions
- UNCOUNTABLE REAL CLOSED FIELDS WITH PA INTEGER PARTS
- Indiscernibles and satisfaction classes in arithmetic
- Automorphisms of models of arithmetic: a unified view
This page was built for publication: Satisfaction classes and automorphisms of models of PA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4218527)