Elementary extensions of recursively saturated models of arithmetic

Notre Dame Journal of Formal Logic 22 (3):193-203 (1981)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1305/ndjfl/1093883454

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,449

External links

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

Through your library

My notes

Similar books and articles

On closed elementary cuts in recursively saturated models of Peano arithmetic.Bożena Piekart - 1993 - Notre Dame Journal of Formal Logic 34 (2):223-230.
Recursively saturated $\omega_1$-like models of arithmetic.Roman Kossak - 1985 - Notre Dame Journal of Formal Logic 26 (4):413-422.
Automorphisms of Countable Recursively Saturated Models of PA: A Survey.Henryk Kotlarski - 1995 - Notre Dame Journal of Formal Logic 36 (4):505-518.
Four Problems Concerning Recursively Saturated Models of Arithmetic.Roman Kossak - 1995 - Notre Dame Journal of Formal Logic 36 (4):519-530.
A note on initial segment constructions in recursively saturated models of arithmetic.C. Smoryński - 1982 - Notre Dame Journal of Formal Logic 23 (4):393-408.
Automorphisms of Countable Short Recursively Saturated Models of PA.Erez Shochat - 2008 - Notre Dame Journal of Formal Logic 49 (4):345-360.
Recursively saturated models generated by indiscernibles.James H. Schmerl - 1985 - Notre Dame Journal of Formal Logic 26 (2):99-105.
End extensions of models of arithmetic.James H. Schmerl - 1992 - Notre Dame Journal of Formal Logic 33 (2):216-219.
Automorphisms of Saturated and Boundedly Saturated Models of Arithmetic.Ermek S. Nurkhaidarov & Erez Shochat - 2011 - Notre Dame Journal of Formal Logic 52 (3):315-329.
Arithmetically Saturated Models of Arithmetic.Roman Kossak & James H. Schmerl - 1995 - Notre Dame Journal of Formal Logic 36 (4):531-546.

Analytics

Added to PP
2010-08-24

Downloads
21 (#1,049,356)

6 months
1 (#1,572,794)

Historical graph of downloads
How can I increase my downloads?

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.
Elementary Cuts in Saturated Models of Peano Arithmetic.James H. Schmerl - 2012 - Notre Dame Journal of Formal Logic 53 (1):1-13.
On Cofinal Submodels and Elementary Interstices.Roman Kossak & James H. Schmerl - 2012 - Notre Dame Journal of Formal Logic 53 (3):267-287.
Four Problems Concerning Recursively Saturated Models of Arithmetic.Roman Kossak - 1995 - Notre Dame Journal of Formal Logic 36 (4):519-530.
Truth in generic cuts.Richard Kaye & Tin Lok Wong - 2010 - Annals of Pure and Applied Logic 161 (8):987-1005.

View all 6 citations / Add more citations

References found in this work

No references found.

Add more references