- 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
Effective model theory vs. recursive model theory
Journal of Symbolic Logic 55 (3):1168-1191 (1990)
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
Handbook of Recursive Mathematics, Volume 1, Recursive Model Theory.Bakhadyr Khoussainov - 2001 - Bulletin of Symbolic Logic 7 (1):66-69.
Toward model theory through recursive saturation.John Stewart Schlipf - 1978 - Journal of Symbolic Logic 43 (2):183-206.
Two-dimensional partial orderings: Recursive model theory.Alfred B. Manaster & Joseph G. Rosenstein - 1980 - Journal of Symbolic Logic 45 (1):121-132.
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Is a spectrum of a non-disintegrated flat strongly minimal model complete theory in a language with finite signature.Uri Andrews & Omer Mermelstein - 2021 - Journal of Symbolic Logic 86 (4):1632-1656.
Review: Hartley Rogers, Theory of Recursive Functions and Effective Computability. [REVIEW]C. E. M. Yates - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Review: Hartley Rogers, Theory of Recursive Functions and Effective Computability. [REVIEW]Clifford Spector - 1959 - Journal of Symbolic Logic 24 (1):70-70.
Review: John Myhill, Recursive Function Theory. [REVIEW]Erik Ellentuck - 1968 - Journal of Symbolic Logic 33 (4):619-620.
Analytics
Added to PP
2009-01-28
Downloads
84 (#205,222)
6 months
25 (#118,685)
2009-01-28
Downloads
84 (#205,222)
6 months
25 (#118,685)
Historical graph of downloads
Citations of this work
Effective categoricity of equivalence structures.Wesley Calvert, Douglas Cenzer, Valentina Harizanov & Andrei Morozov - 2006 - Annals of Pure and Applied Logic 141 (1):61-78.
Enumerations in computable structure theory.Sergey Goncharov, Valentina Harizanov, Julia Knight, Charles McCoy, Russell Miller & Reed Solomon - 2005 - Annals of Pure and Applied Logic 136 (3):219-246.
An introduction to the Scott complexity of countable structures and a survey of recent results.Matthew Harrison-Trainor - 2022 - Bulletin of Symbolic Logic 28 (1):71-103.
Δ20-categoricity in Boolean algebras and linear orderings.Charles F. D. McCoy - 2003 - Annals of Pure and Applied Logic 119 (1-3):85-120.
Computable structures of rank.J. F. Knight & J. Millar - 2010 - Journal of Mathematical Logic 10 (1):31-43.
References found in this work
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Stability of recursive structures in arithmetical degrees.C. J. Ash - 1986 - Annals of Pure and Applied Logic 32:113-135.
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-68866f4b87-sz9d2 uwo