- 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)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 computable dimension of trees of infinite height.Russell Miller - 2005 - Journal of Symbolic Logic 70 (1):111-141.
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.
Generic expansions of ω-categorical structures and semantics of generalized quantifiers.A. A. Ivanov - 1999 - Journal of Symbolic Logic 64 (2):775-789.
Ages of Expansions of ω-Categorical Structures.A. Ivanov & K. Majcher - 2007 - Notre Dame Journal of Formal Logic 48 (3):371-380.
Computable categoricity of trees of finite height.Steffen Lempp, Charles McCoy, Russell Miller & Reed Solomon - 2005 - Journal of Symbolic Logic 70 (1):151-215.
Definable sets in Boolean ordered o-minimal structures. II.Roman Wencel - 2003 - Journal of Symbolic Logic 68 (1):35-51.
Interpreting groups in ω-categorical structures.Dugald Macpherson - 1991 - Journal of Symbolic Logic 56 (4):1317-1324.
ℵ0-categorical tree-decomposable structures.A. H. Lachlan - 1992 - Journal of Symbolic Logic 57 (2):501 - 514.
Isomorphisms of splits of computably enumerable sets.Peter A. Cholak & Leo A. Harrington - 2003 - Journal of Symbolic Logic 68 (3):1044-1064.
A computably categorical structure whose expansion by a constant has infinite computable dimension.Denis R. Hirschfeldt, Bakhadyr Khoussainov & Richard A. Shore - 2003 - Journal of Symbolic Logic 68 (4):1199-1241.
Analytics
Added to PP
2009-01-28
Downloads
58 (#271,353)
6 months
6 (#512,819)
2009-01-28
Downloads
58 (#271,353)
6 months
6 (#512,819)
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-7c76586df8-5tf24 uwo