Jon Barwise and John Schlipf. An introduction to recursively saturated and resplendent models. The journal of symbolic logic, vol. 41 , pp. 531–536

Journal of Symbolic Logic 47 (2):440 (1982)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2273157

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

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

Review: Jon Barwise, John Schlipf, An Introduction to Recursively Saturated and Resplendent Models. [REVIEW]Julia F. Knight - 1982 - Journal of Symbolic Logic 47 (2):440-440.
An Introduction to Recursively Saturated and Resplendent Models.Jon Barwise & John Schlipf - 1982 - Journal of Symbolic Logic 47 (2):440-440.
An introduction to recursively saturated and resplendent models.Jon Barwise & John Schlipf - 1976 - Journal of Symbolic Logic 41 (2):531-536.
Jon Barwise and John Schlipf. On recursively saturated models of arithmetic. Model theory and algebra, A memorial tribute to Abraham Robinson, edited by D. H. Saracino and V. B. Weispfenning, Lecture notes in mathematics, vol. 498, Springer-Verlag, Berlin, Heidelberg, and New York, 1975, pp. 42–55. - Patrick Cegielski, Kenneth McAloon, and George Wilmers. Modèles récursivement saturés de l'addition et de la multiplication des entiers naturels. Logic Colloquium '80, Papers intended for the European summer meeting of the Association for Symbolic Logic, edited by D. van Dalen, D. Lascar, and T. J. Smiley, Studies in logic and the foundations of mathematics, vol. 108, North-Holland Publishing Company, Amsterdam, New York, and London, 1982, pp. 57–68. - Julia F. Knight. Theories whose resplendent models are homogeneous. Israel journal of mathematics, vol. 42 , pp. 151–161. - Julia Knight and Mark Nadel. Expansions of models and Turing degrees. The journal of symbolic logic, vol. 47 , pp. 58. [REVIEW]J. -P. Ressayre - 1987 - Journal of Symbolic Logic 52 (1):279-284.
The spectrum of resplendency.John T. Baldwin - 1990 - Journal of Symbolic Logic 55 (2):626-636.
Resplendent models and $${\Sigma_1^1}$$ -definability with an oracle.Andrey Bovykin - 2008 - Archive for Mathematical Logic 47 (6):607-623.
Automorphisms of Countable Short Recursively Saturated Models of PA.Erez Shochat - 2008 - Notre Dame Journal of Formal Logic 49 (4):345-360.
Four Problems Concerning Recursively Saturated Models of Arithmetic.Roman Kossak - 1995 - Notre Dame Journal of Formal Logic 36 (4):519-530.
Models with the ω-property.Roman Kossak - 1989 - Journal of Symbolic Logic 54 (1):177-189.
The complexity of classification problems for models of arithmetic.Samuel Coskey & Roman Kossak - 2010 - Bulletin of Symbolic Logic 16 (3):345-358.
Model Theory and Algebra.Jon Barwise, John Schlipf, D. H. Saracino & V. B. Weispfenning - 1987 - Journal of Symbolic Logic 52 (1):279-284.
Review: Jon Barwise, John Schlipf, D. H. Saracino, V. B. Weispfenning, Model Theory and Algebra. [REVIEW]J.-P. Ressayre - 1987 - Journal of Symbolic Logic 52 (1):279-284.
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.
A Galois correspondence for countable short recursively saturated models of PA.Erez Shochat - 2010 - Mathematical Logic Quarterly 56 (3):228-238.
Nonstandard characterizations of recursive saturation and resplendency.Stuart T. Smith - 1987 - Journal of Symbolic Logic 52 (3):842-863.

Analytics

Added to PP
2016-06-30

Downloads
27 (#574,515)

6 months
8 (#342,364)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references