- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Toward model theory through recursive saturation
Journal of Symbolic Logic 43 (2):183-206 (1978)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Game sentences, recursive saturation and definability.Victor Harnik - 1980 - Journal of Symbolic Logic 45 (1):35-46.
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.
Nonstandard characterizations of recursive saturation and resplendency.Stuart T. Smith - 1987 - Journal of Symbolic Logic 52 (3):842-863.
Effective model theory vs. recursive model theory.John Chisholm - 1990 - Journal of Symbolic Logic 55 (3):1168-1191.
Handbook of Recursive Mathematics, Volume 1, Recursive Model Theory.Bakhadyr Khoussainov - 2001 - Bulletin of Symbolic Logic 7 (1):66-69.
The automorphism group of a resplendent model.James H. Schmerl - 2012 - Archive for Mathematical Logic 51 (5-6):647-649.
Two-dimensional partial orderings: Recursive model theory.Alfred B. Manaster & Joseph G. Rosenstein - 1980 - Journal of Symbolic Logic 45 (1):121-132.
Analytics
Added to PP
2009-01-28
Downloads
60 (#395,774)
6 months
11 (#346,176)
2009-01-28
Downloads
60 (#395,774)
6 months
11 (#346,176)
Historical graph of downloads
Citations of this work
Automorphisms of recursively saturated models of arithmetic.Richard Kaye, Roman Kossak & Henryk Kotlarski - 1991 - Annals of Pure and Applied Logic 55 (1):67-99.
Local collection and end-extensions of models of compositional truth.Mateusz Łełyk & Bartosz Wcisło - 2021 - Annals of Pure and Applied Logic 172 (6):102941.
Full Satisfaction Classes, Definability, and Automorphisms.Bartosz Wcisło - 2022 - Notre Dame Journal of Formal Logic 63 (2):143-163.
Peano Corto and Peano Basso: A Study of Local Induction in the Context of Weak Theories.Albert Visser - 2014 - Mathematical Logic Quarterly 60 (1-2):92-117.
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.
Models with compactness properties relative to an admissible language.J. P. Ressayre - 1977 - Annals of Mathematical Logic 11 (1):31.
A guide to the identification of admissible sets above structures.John S. Schlipf - 1977 - Annals of Mathematical Logic 12 (2):151.
Generalized interpolation and definability.David W. Kueker - 1970 - Annals of Mathematical Logic 1 (4):423.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-5b9ff6f457-cbsf4 uwo