An Introduction to Recursively Saturated and Resplendent Models

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

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2273157

Other Versions

original Barwise, Jon; Schlipf, John (1976) "An introduction to recursively saturated and resplendent models". Journal of Symbolic Logic 41(2):531-536

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,854

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

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. An introduction to recursively saturated and resplendent models. The journal of symbolic logic, vol. 41 , pp. 531–536.Julia F. Knight - 1982 - Journal of Symbolic Logic 47 (2):440.
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.
Resplendent models and $${\Sigma_1^1}$$ -definability with an oracle.Andrey Bovykin - 2008 - Archive for Mathematical Logic 47 (6):607-623.
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.
Ω1-like recursively saturated models of Presburger's arithmetic.Victor Harnik - 1986 - Journal of Symbolic Logic 51 (2):421-429.
The complexity of classification problems for models of arithmetic.Samuel Coskey & Roman Kossak - 2010 - Bulletin of Symbolic Logic 16 (3):345-358.

Analytics

Added to PP
2017-02-21

Downloads
20 (#1,050,317)

6 months
1 (#1,892,942)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Condensable models of set theory.Ali Enayat - 2022 - Archive for Mathematical Logic 61 (3):299-315.
Model theory of the regularity and reflection schemes.Ali Enayat & Shahram Mohsenipour - 2008 - Archive for Mathematical Logic 47 (5):447-464.
Foundations of recursive model theory.Terrence S. Millar - 1978 - Annals of Mathematical Logic 13 (1):45.
Positive logics.Saharon Shelah & Jouko Väänänen - 2023 - Archive for Mathematical Logic 62 (1):207-223.

Add more citations

References found in this work

No references found.

Add more references