Results 1  10
of
10
Computable Isomorphisms, Degree Spectra of Relations, and Scott Families
 Ann. Pure Appl. Logic
, 1998
"... this paper we are interested in those structures in which the basic computations can be performed by Turing machines. ..."
Abstract

Cited by 26 (12 self)
 Add to MetaCart
this paper we are interested in those structures in which the basic computations can be performed by Turing machines.
Effective Categoricity of Equivalence Structures
 Annals of Pure and Applied Logic 141 (2006
, 2005
"... We investigate effective categoricity of computable equivalence structures A. We show that A is computably categorical if and only if A has only finitely many finite equivalence classes, or A has only finitely many infinite classes, bounded character, and at most one finite k such that there are inf ..."
Abstract

Cited by 13 (9 self)
 Add to MetaCart
We investigate effective categoricity of computable equivalence structures A. We show that A is computably categorical if and only if A has only finitely many finite equivalence classes, or A has only finitely many infinite classes, bounded character, and at most one finite k such that there are infinitely many classes of size k. We also prove that all computably categorical structures are relatively computably categorical, that is, have computably enumerable Scott families of existential formulas. Since all computable equivalence structures are relatively ∆ 0 3 categorical, we further investigate when they are ∆ 0 2 categorical. We also obtain results on the index sets of computable equivalence structures. ∗ The authors would like to thank the anonymous referee for his comments and suggestions. † Calvert was partially supported by the NSF grants DMS9970452, DMS0139626, and DMS0353748, Harizanov by the NSF grant DMS0502499, and the last three authors by the NSF binational grant DMS0075899. Harizanov and Morozov also gratefully acknowledge the
Computable categoricity of trees of finite height
 Journal of Symbolic Logic
"... We characterize the structure of computably categorical trees of finite height, and prove that our criterion is both necessary and sufficient. Intuitively, the characterization is easiest to express in terms of isomorphisms of (possibly infinite) trees, but in fact it is equivalent to a Σ0 3conditi ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
We characterize the structure of computably categorical trees of finite height, and prove that our criterion is both necessary and sufficient. Intuitively, the characterization is easiest to express in terms of isomorphisms of (possibly infinite) trees, but in fact it is equivalent to a Σ0 3condition. We show that all trees which are not computably categorical have computable dimension ω. Finally, we prove that for every n ≥ 1 in ω, there exists a computable tree of finite height which is ∆0 n+1categorical but not ∆0 ncategorical.
Effective Categoricity of Abelian pGroups
, 2007
"... We investigate effective categoricity of computable Abelian pgroups A. We prove that all computably categorical Abelian pgroups are relatively computably categorical, that is, have computably enumerable Scott families of existential formulas. We investigate which computable Abelian pgroups are ∆ ..."
Abstract
 Add to MetaCart
We investigate effective categoricity of computable Abelian pgroups A. We prove that all computably categorical Abelian pgroups are relatively computably categorical, that is, have computably enumerable Scott families of existential formulas. We investigate which computable Abelian pgroups are ∆ 0 2 categorical and relatively ∆ 0 2 categorical. 1
Complexity and Categoricity
, 2002
"... Abstract We define a notion of a feasible Scott family of formulas for a feasible model and give various conditions on a Scott family which imply that two models with the same family are feasibly isomorphic. For example, if A and B possess a common strongly ptime Scott family and both have universe ..."
Abstract
 Add to MetaCart
Abstract We define a notion of a feasible Scott family of formulas for a feasible model and give various conditions on a Scott family which imply that two models with the same family are feasibly isomorphic. For example, if A and B possess a common strongly ptime Scott family and both have universe f1g \Lambda, then they are ptime isomorphic. These
COMPUTABLE CATEGORICITY VERSUS RELATIVE COMPUTABLE CATEGORICITY
"... Abstract. We study the notion of computable categoricity of computable structures, comparing it especially to the notion of relative computable categoricity and its relativizations. We show that every 1decidable computably categorical structure is relatively ∆0 2categorical. We study the complexit ..."
Abstract
 Add to MetaCart
Abstract. We study the notion of computable categoricity of computable structures, comparing it especially to the notion of relative computable categoricity and its relativizations. We show that every 1decidable computably categorical structure is relatively ∆0 2categorical. We study the complexity of various index sets associated with computable categoricity and relative computable categoricity. We also introduce and study a variation of relative computable categoricity, comparing it to both computable categoricity and relative computable categoricity and its relativizations. 1.
Effective Algebra and Effective Dimension By
"... Effective Dimension is a notion introduced by Lutz, which measures the density of information in an infinite sequence. Lutz asks how this concept interacts with classical topological notions. In Chapter two, I present several results concerning this. Effective Algebra is the study of computable and ..."
Abstract
 Add to MetaCart
Effective Dimension is a notion introduced by Lutz, which measures the density of information in an infinite sequence. Lutz asks how this concept interacts with classical topological notions. In Chapter two, I present several results concerning this. Effective Algebra is the study of computable and relatively computable structures and the relations on them. In Chapter three, I present several results separating notions of computable categoricity. In Chapter four, I review limitwise monotonic functions and prove several new results about them. In Chapter five, I construct computable linear orders on which various natural relations are intrinsically complete. Acknowledgements ii I would like to thank my thesis advisor, Steffen Lempp, for his advice and guidance, and most of all his patience in the face of my colossal lack of organization. I am also grateful to all the logic faculty at UWMadison, with special mention to Joseph Miller. Thanks also to Rod Downey and Noam Greenberg for a very productive semester in New Zealand. Thanks to Nick for being tall, and to all the graduate students and former graduate