Models with the ω-property

Journal of Symbolic Logic 54 (1):177-189 (1989)
  Copy   BIBTEX

Abstract

A model M of PA has the omega-property if it has a subset of order type omega that is coded in an elementary end extension of M. All countable recursively saturated models have the omega-property, but there are also models with the omega-property that are not recursively saturated. The papers is devoted to the study of structural properties of such models.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 76,400

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
33 (#356,448)

6 months
1 (#452,962)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Roman Kossak
City University of New York

Citations of this work

Arithmetically Saturated Models of Arithmetic.Roman Kossak & James H. Schmerl - 1995 - Notre Dame Journal of Formal Logic 36 (4):531-546.
On Cofinal Submodels and Elementary Interstices.Roman Kossak & James H. Schmerl - 2012 - Notre Dame Journal of Formal Logic 53 (3):267-287.

Add more citations

References found in this work

A note on satisfaction classes.Roman Kossak - 1985 - Notre Dame Journal of Formal Logic 26 (1):1-8.
Recursively saturated $\omega_1$-like models of arithmetic.Roman Kossak - 1985 - Notre Dame Journal of Formal Logic 26 (4):413-422.

Add more references