- 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
Computably categorical structures and expansions by constants
Journal of Symbolic Logic 64 (1):13-37 (1999)
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
S. S. Goncharov. Autostability and computable families of constructivizations. Algebra and Logic, vol. 14 (1975), no. 6, pp. 392–409. - S. S. Goncharov. The quantity of nonautoequivalent constructivizations. Algebra and Logic, vol. 16 (1977), no. 3, pp. 169–185. - S. S. Goncharov and V. D. Dzgoev. Autostability of models. Algebra and Logic, vol. 19 (1980), no. 1, pp. 28–37. - J. B. Remmel. Recursively categorical linear orderings. Proceedings of the American Mathematical Society, vol. 83 (1981), no. 2, pp. 387–391. - Terrence Millar. Recursive categoricity and persistence. The Journal of Symbolic Logic, vol. 51 (1986), no. 2, pp. 430–434. - Peter Cholak, Segey Goncharov, Bakhadyr Khoussainov and Richard A. Shore. Computably categorical structures and expansions by constants. The Journal of Symbolic Logic, vol. 64 (1999), no. 1, pp. 13–137. - Peter Cholak, Richard A. Shore and Reed Solomon. A computably stable structure with no Scott family of finitary formulas. Archive for Mathematical. [REVIEW]Daniel Turetsky - 2012 - Bulletin of Symbolic Logic 18 (1):131-134.
A computably categorical structure whose expansion by a constant has infinite computable dimension.Denis Hirschfeldt, Bakhadyr Khoussainov & Richard Shore - 2003 - Journal of Symbolic Logic 68 (4):1199-1241.
Computable isomorphisms, degree spectra of relations, and Scott families.Bakhadyr Khoussainov & Richard A. Shore - 1998 - Annals of Pure and Applied Logic 93 (1-3):153-193.
Reviewed Work(s): A new spectrum of recursive models using an amalgamation construction. The Journal of Symbolic Logic, vol. 73 by Uri Andrews; A computable N₀-categorical structure whose theory computes true arithmetic. The Journal of Symbolic Logic, vol. 72 by Bakhadyr Khoussainov; Antonio Montalbán. [REVIEW]Review by: Alexander G. Melnikov - 2013 - Bulletin of Symbolic Logic 19 (3):400-401,.
Uri Andrews. A new spectrum of recursive models using an amalgamation construction. The Journal of Symbolic Logic, vol. 73 (2011), no. 3, pp. 883–896. - Bakhadyr Khoussainov and Antonio Montalbán. A computable ℵ 0 -categorical structure whose theory computes true arithmetic. The Journal of Symbolic Logic, vol. 72 (2010), no. 2, pp. 728–740. [REVIEW]Alexander G. Melnikov - 2013 - Bulletin of Symbolic Logic 19 (3):400-401.
Reviewed Work(s): A new spectrum of recursive models using an amalgamation construction. The Journal of Symbolic Logic, vol. 73 by Uri Andrews; A computable N₀-categorical structure whose theory computes true arithmetic. The Journal of Symbolic Logic, vol. 72 by Bakhadyr Khoussainov; Antonio Montalbán. [REVIEW]Alexander G. Melnikov - forthcoming - Association for Symbolic Logic: The Bulletin of Symbolic Logic.
Ages of Expansions of ω-Categorical Structures.A. Ivanov & K. Majcher - 2007 - Notre Dame Journal of Formal Logic 48 (3):371-380.
Analytics
Added to PP
2009-01-28
Downloads
73 (#287,166)
6 months
5 (#1,038,502)
2009-01-28
Downloads
73 (#287,166)
6 months
5 (#1,038,502)
Historical graph of downloads
Citations of this work
Degree spectra and computable dimensions in algebraic structures.Denis R. Hirschfeldt, Bakhadyr Khoussainov, Richard A. Shore & Arkadii M. Slinko - 2002 - Annals of Pure and Applied Logic 115 (1-3):71-113.
Degrees of categoricity of computable structures.Ekaterina B. Fokina, Iskander Kalimullin & Russell Miller - 2010 - Archive for Mathematical Logic 49 (1):51-67.
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.
Finite computable dimension and degrees of categoricity.Barbara F. Csima & Jonathan Stephenson - 2019 - Annals of Pure and Applied Logic 170 (1):58-94.
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-667477cd97-wmc4m dc2