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: 17 October 2018

ω1-LIKE MODELS

ω1-LIKE MODELS

Chapter:
(p.256) 10 ω1-LIKE MODELS
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.0010

This chapter presents several constructions of ω1-like models with interesting second order properties. The list includes: recursively saturated rather classless models, rigid recursively saturated models, models whose additive reducts are isomorphic but whose multiplicative reducts are not, and very similar but nonisomorphic models. The chapter also presents two constructions used in completeness theorems for Peano Arithmetic with the Ramsey quantifier and the stationary quantifier.

Keywords:   rather classless model, rigid model, additive reduct, multiplicative reduct, Ramsey quantifier, stationary logic

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 .