Recursively saturated models generated by indiscernibles

Notre Dame Journal of Formal Logic 26 (2):99-105 (1985)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1305/ndjfl/1093870818

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,907

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

The complexity of classification problems for models of arithmetic.Samuel Coskey & Roman Kossak - 2010 - Bulletin of Symbolic Logic 16 (3):345-358.
Four Problems Concerning Recursively Saturated Models of Arithmetic.Roman Kossak - 1995 - Notre Dame Journal of Formal Logic 36 (4):519-530.
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.
Models with the ω-property.Roman Kossak - 1989 - Journal of Symbolic Logic 54 (1):177-189.
Large resplendent models generated by indiscernibles.James H. Schmerl - 1989 - Journal of Symbolic Logic 54 (4):1382-1388.
Recursively saturated nonstandard models of arithmetic.C. Smoryński - 1981 - Journal of Symbolic Logic 46 (2):259-286.
Recursively saturated nonstandard models of arithmetic; addendum.C. Smoryński - 1982 - Journal of Symbolic Logic 47 (3):493-494.
An introduction to recursively saturated and resplendent models.Jon Barwise & John Schlipf - 1976 - Journal of Symbolic Logic 41 (2):531-536.
Elementary extensions of recursively saturated models of arithmetic.C. Smoryński - 1981 - Notre Dame Journal of Formal Logic 22 (3):193-203.
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.
Automorphisms of Countable Short Recursively Saturated Models of PA.Erez Shochat - 2008 - Notre Dame Journal of Formal Logic 49 (4):345-360.
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.
Modèles saturés et modèles engendrés Par Des indiscernables.Benoît Mariou - 2001 - Journal of Symbolic Logic 66 (1):325-348.

Analytics

Added to PP
2010-08-24

Downloads
13 (#1,061,253)

6 months
7 (#486,539)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Automorphisms of models of arithmetic: a unified view.Ali Enayat - 2007 - Annals of Pure and Applied Logic 145 (1):16-36.
Automorphisms of Countable Recursively Saturated Models of PA: A Survey.Henryk Kotlarski - 1995 - Notre Dame Journal of Formal Logic 36 (4):505-518.

View all 11 citations / Add more citations

References found in this work

No references found.

Add more references