Jump to ContentJump to Main Navigation
The Structure of Models of Peano Arithmetic$
Users without a subscription are not able to see the full content.

Roman Kossak and James Schmerl

Print publication date: 2006

Print ISBN-13: 9780198568278

Published to Oxford Scholarship Online: September 2007

DOI: 10.1093/acprof:oso/9780198568278.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2018. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a monograph in OSO for personal use (for details see www.oxfordscholarship.com/page/privacy-policy).date: 15 December 2018

BASICS

BASICS

Chapter:
(p.1) 1 BASICS
Source:
The Structure of Models of Peano Arithmetic
Author(s):

Roman Kossak

James H. Schmerl

Publisher:
Oxford University Press
DOI:10.1093/acprof:oso/9780198568278.003.0001

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.

Keywords:   coding in arithmetic, Blass-Gaifman Lemma, Ehrenfeucht Lemma, arithmetic saturation

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.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .