- 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
Recursively presentable prime models
Journal of Symbolic Logic 39 (2):305-309 (1974)
Abstract
This article has no associated abstract. (fix it)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
Harrington Leo. Recursively presentable prime models.C. J. Ash - 1984 - Journal of Symbolic Logic 49 (2):671-672.
A new spectrum of recursive models using an amalgamation construction.Uri Andrews - 2011 - Journal of Symbolic Logic 76 (3):883 - 896.
Haim Gaifman. Models and types of Peano's arithmetic. Annals of mathematical logic, vol. 9, pp. 223–306. - Julia F. Knight. Omitting types in set theory and arithmetic. The journal of symbolic logic, vol. 41 , pp. 25–32. - Julia F. Knight. Hanf numbers for omitting types over particular theories. The journal of symbolic logic, vol. 41 , pp. 583–588. - Fred G. Abramson and Leo A. Harrington. Models without indiscernibles. The journal of symbolic logic, vol. 41 , vol. 43 , pp. 572–600. [REVIEW]J. P. Ressayre - 1983 - Journal of Symbolic Logic 48 (2):484-485.
An introduction to recursively saturated and resplendent models.Jon Barwise & John Schlipf - 1976 - Journal of Symbolic Logic 41 (2):531-536.
Recursively saturated nonstandard models of arithmetic.C. Smoryński - 1981 - Journal of Symbolic Logic 46 (2):259-286.
On recursively enumerable and arithmetic models of set theory.Michael O. Rabin - 1958 - Journal of Symbolic Logic 23 (4):408-416.
Recursively saturated nonstandard models of arithmetic; addendum.C. Smoryński - 1982 - Journal of Symbolic Logic 47 (3):493-494.
Analytics
Added to PP
2009-01-28
Downloads
38 (#569,143)
6 months
11 (#299,231)
2009-01-28
Downloads
38 (#569,143)
6 months
11 (#299,231)
Historical graph of downloads
Citations of this work
Computable Models of Theories with Few Models.Bakhadyr Khoussainov, Andre Nies & Richard A. Shore - 1997 - Notre Dame Journal of Formal Logic 38 (2):165-178.
Foundations of online structure theory.Nikolay Bazhenov, Rod Downey, Iskander Kalimullin & Alexander Melnikov - 2019 - Bulletin of Symbolic Logic 25 (2):141-181.
An Uncountably Categorical Theory Whose Only Computably Presentable Model Is Saturated.Denis R. Hirschfeldt, Bakhadyr Khoussainov & Pavel Semukhin - 2006 - Notre Dame Journal of Formal Logic 47 (1):63-71.
Turing degree spectra of differentially closed fields.David Marker & Russell Miller - 2017 - Journal of Symbolic Logic 82 (1):1-25.
Relative to any non-hyperarithmetic set.Noam Greenberg, Antonio Montalbán & Theodore A. Slaman - 2013 - Journal of Mathematical Logic 13 (1):1250007.
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-6f97f49787-zlfb6 uwo