An introduction to recursively saturated and resplendent models

Journal of Symbolic Logic 41 (2):531-536 (1976)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

reprint Barwise, Jon; Schlipf, John (1982) "An Introduction to Recursively Saturated and Resplendent Models". Journal of Symbolic Logic 47(2):440-440

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 107,455

External links

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

Through your library

Similar books and articles

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.

Analytics

Added to PP
2009-01-28

Downloads
60 (#411,059)

6 months
8 (#669,926)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Pairs of recursive structures.C. J. Ash & J. F. Knight - 1990 - Annals of Pure and Applied Logic 46 (3):211-234.
Axiomatizing first-order consequences in dependence logic.Juha Kontinen & Jouko Väänänen - 2013 - Annals of Pure and Applied Logic 164 (11):1101-1117.
A Natural Model of the Multiverse Axioms.Victoria Gitman & Joel David Hamkins - 2010 - Notre Dame Journal of Formal Logic 51 (4):475-484.
Nonstandard definability.Stuart T. Smith - 1989 - Annals of Pure and Applied Logic 42 (1):21-43.
Axiomatizing first-order consequences in independence logic.Miika Hannula - 2015 - Annals of Pure and Applied Logic 166 (1):61-91.

View all 18 citations / Add more citations

References found in this work

Review: C. C. Chang, H. J. Keisler, Model Theory. [REVIEW]Michael Makkai - 1991 - Journal of Symbolic Logic 56 (3):1096-1097.
Generalized interpolation and definability.David W. Kueker - 1970 - Annals of Mathematical Logic 1 (4):423.

Add more references