This introductory chapter covers a wide range of topics, from basic notational conventions and coding in arithmetic to important classical results. The well-known theorems, such as Gaifman's splitting theorem, Arithmetized Completeness Theorem, or Friedman's Embedding Theorem are discussed without proofs. Proofs are given for less known facts, like Blass-Gaifman and Ehrenfeucht lemmas. The chapter also presents a systematic introduction to recursively and arithmetically saturated models, resplendent models, and satisfaction classes.
Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.
If you think you should have access to this title, please contact your librarian.