- 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
The complexity of classification problems for models of arithmetic.Samuel Coskey & Roman Kossak - 2010 - Bulletin of Symbolic Logic 16 (3):345-358.
Degree Spectra of Prime Models.Barbara F. Csima - 2004 - Journal of Symbolic Logic 69 (2):430 - 442.
Prime numbers and factorization in IE1 and weaker systems.Stuart T. Smith - 1992 - Journal of Symbolic Logic 57 (3):1057 - 1085.
On recursive enumerability with finite repetitions.Stephan Wehner - 1999 - Journal of Symbolic Logic 64 (3):927-945.
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.
Theories with exactly three countable models and theories with algebraic prime models.Anand Pillay - 1980 - Journal of Symbolic Logic 45 (2):302-310.
Bounding Prime Models.Barbara F. Csima, Denis R. Hirschfeldt, Julia F. Knight & Robert I. Soare - 2004 - Journal of Symbolic Logic 69 (4):1117 - 1142.
Analytics
Added to PP
2009-01-28
Downloads
21 (#695,936)
6 months
14 (#154,299)
2009-01-28
Downloads
21 (#695,936)
6 months
14 (#154,299)
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.
Turing degree spectra of differentially closed fields.David Marker & Russell Miller - 2017 - Journal of Symbolic Logic 82 (1):1-25.
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.
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-7c76586df8-pp8v9 uwo