•  13
•  5
•  16
##### Σ 1 0 and Π 1 0 equivalence structures with Douglas Cenzer and Jeffrey B. Remmel Annals of Pure and Applied Logic 162 (7): 490-503. 2011.
We study computability theoretic properties of and equivalence structures and how they differ from computable equivalence structures or equivalence structures that belong to the Ershov difference hierarchy. Our investigation includes the complexity of isomorphisms between equivalence structures and between equivalence structures
•  9
##### Partial automorphism semigroups with Jennifer Chubb, Andrei S. Morozov, Sarah Pingrey, and Eric Ufferman Annals of Pure and Applied Logic 156 (2): 245-258. 2008.
We study the relationship between algebraic structures and their inverse semigroups of partial automorphisms. We consider a variety of classes of natural structures including equivalence structures, orderings, Boolean algebras, and relatively complemented distributive lattices. For certain subsemigroups of these inverse semigroups, isomorphism of the subsemigroups yields isomorphism of the underlying structures. We also prove that for some classes of computable structures, we can reconstruct a c…Read more
•  8
##### $\Pi _{1}^{0}$ Classes and Strong Degree Spectra of Relations with John Chisholm, Jennifer Chubb, Denis R. Hirschfeldt, Carl G. Jockusch, Timothy McNicholl, and Sarah Pingrey Journal of Symbolic Logic 72 (3). 2007.
We study the weak truth-table and truth-table degrees of the images of subsets of computable structures under isomorphisms between computable structures. In particular, we show that there is a low c.e. set that is not weak truth-table reducible to any initial segment of any scattered computable linear ordering. Countable $\Pi _{1}^{0}$ subsets of 2ω and Kolmogorov complexity play a major role in the proof
•  27
##### Bounding Homogeneous Models with Barbara F. Csima, Denis R. Hirschfeldt, and Robert I. Soare Journal of Symbolic Logic 72 (1). 2007.
A Turing degree d is homogeneous bounding if every complete decidable (CD) theory has a d-decidable homogeneous model A, i.e., the elementary diagram De (A) has degree d. It follows from results of Macintyre and Marker that every PA degree (i.e., every degree of a complete extension of Peano Arithmetic) is homogeneous bounding. We prove that in fact a degree is homogeneous bounding if and only if it is a PA degree. We do this by showing that there is a single CD theory T such that every homogene…Read more
•  6
##### Some effects of Ash–Nerode and other decidability conditions on degree spectra Annals of Pure and Applied Logic 55 (1): 51-65. 1991.
With every new recursive relation R on a recursive model , we consider the images of R under all isomorphisms from to other recursive models. We call the set of Turing degrees of these images the degree spectrum of R on , and say that R is intrinsically r.e. if all the images are r.e. C. Ash and A. Nerode introduce an extra decidability condition on , expressed in terms of R. Assuming this decidability condition, they prove that R is intrinsically r.e. if and only if a natural recursive-syntacti…Read more
•  36
##### Chains and antichains in partial orderings with Carl G. Jockusch and Julia F. Knight Archive for Mathematical Logic 48 (1): 39-53. 2009.
We study the complexity of infinite chains and antichains in computable partial orderings. We show that there is a computable partial ordering which has an infinite chain but none that is ${\Sigma _{1}^{1}}$ or ${\Pi _{1}^{1}}$ , and also obtain the analogous result for antichains. On the other hand, we show that every computable partial ordering which has an infinite chain must have an infinite chain that is the difference of two ${\Pi _{1}^{1}}$ sets. Our main result is that there is a computa…Read more
•  27
##### Isomorphism relations on computable structures with Ekaterina B. Fokina, Sy-David Friedman, Julia F. Knight, Charles Mccoy, and Antonio Montalbán Journal of Symbolic Logic 77 (1): 122-132. 2012.
We study the complexity of the isomorphism relation on classes of computable structures. We use the notion of FF-reducibility introduced in [9] to show completeness of the isomorphism relation on many familiar classes in the context of all ${\mathrm{\Sigma }}_{1}^{1}$ equivalence relations on hyperarithmetical subsets of ω
•  14
•  6
##### Turing degrees of hypersimple relations on computable structures Annals of Pure and Applied Logic 121 (2-3): 209-226. 2003.
Let be an infinite computable structure, and let R be an additional computable relation on its domain A. The syntactic notion of formal hypersimplicity of R on , first introduced and studied by Hird, is analogous to the computability-theoretic notion of hypersimplicity of R on A, given the definability of certain effective sequences of relations on A. Assuming that R is formally hypersimple on , we give general sufficient conditions for the existence of a computable isomorphic copy of on whose d…Read more
•  13
##### Computability of fraïssé limits with Barbara F. Csima, Russell Miller, and Antonio Montalbán Journal of Symbolic Logic 76 (1). 2011.
Fraïssé studied countable structures S through analysis of the age of S i.e., the set of all finitely generated substructures of S. We investigate the effectiveness of his analysis, considering effectively presented lists of finitely generated structures and asking when such a list is the age of a computable structure. We focus particularly on the Fraïssé limit. We also show that degree spectra of relations on a sufficiently nice Fraïssé limit are always upward closed unless the relation is defi…Read more
•  10
•  9
##### Effective categoricity of Abelian p -groups with Wesley Calvert, Douglas Cenzer, and Andrei Morozov Annals of Pure and Applied Logic 159 (1-2): 187-197. 2009.
We investigate effective categoricity of computable Abelian p-groups . We prove that all computably categorical Abelian p-groups are relatively computably categorical, that is, have computably enumerable Scott families of existential formulas. We investigate which computable Abelian p-groups are categorical and relatively categorical
•  20
•  27
•  9
•  35
##### Intrinsic bounds on complexity and definability at limit levels with John Chisholm, Ekaterina B. Fokina, Sergey S. Goncharov, Julia F. Knight, and Sara Quinn Journal of Symbolic Logic 74 (3): 1047-1060. 2009.
We show that for every computable limit ordinal α, there is a computable structure A that is $\Delta _\alpha ^0$ categorical, but not relatively $\Delta _\alpha ^0$ categorical (equivalently. it does not have a formally $\Sigma _\alpha ^0$ Scott family). We also show that for every computable limit ordinal a, there is a computable structure A with an additional relation R that is intrinsically $\Sigma _\alpha ^0$ on A. but not relatively intrinsically $\Sigma _\alpha ^0$ on A (equivalently,…Read more
•  10
##### The possible turing degree of the nonzero member in a two element degree spectrum Annals of Pure and Applied Logic 60 (1): 1-30. 1993.
We construct a recursive model , a recursive subset R of its domain, and a Turing degree x 0 satisfying the following condition. The nonrecursive images of R under all isomorphisms from to other recursive models are of Turing degree x and cannot be recursively enumerable
•  5
•  36
Let
•  23
##### Spaces of orders and their Turing degree spectra with Malgorzata A. Dabkowska, Mieczyslaw K. Dabkowski, and Amir A. Togha Annals of Pure and Applied Logic 161 (9): 1134-1143. 2010.
We investigate computability theoretic and topological properties of spaces of orders on computable orderable groups. A left order on a group G is a linear order of the domain of G, which is left-invariant under the group operation. Right orders and bi-orders are defined similarly. In particular, we study groups for which the spaces of left orders are homeomorphic to the Cantor set, and their Turing degree spectra contain certain upper cones of degrees. Our approach unifies and extends Sikora’s …Read more
•  21
•  15
##### Effective categoricity of equivalence structures with Wesley Calvert, Douglas Cenzer, and Andrei Morozov Annals of Pure and Applied Logic 141 (1): 61-78. 2006.
We investigate effective categoricity of computable equivalence structures . We show that is computably categorical if and only if has only finitely many finite equivalence classes, or 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. Sin…Read more
•  17
##### Effectively and Noneffectively Nowhere Simple Sets Mathematical Logic Quarterly 42 (1): 241-248. 1996.
R. Shore proved that every recursively enumerable set can be split into two nowhere simple sets. Splitting theorems play an important role in recursion theory since they provide information about the lattice ϵ of all r. e. sets. Nowhere simple sets were further studied by D. Miller and J. Remmel, and we generalize some of their results. We characterize r. e. sets which can be split into two effectively nowhere simple sets, and r. e. sets which can be split into two r. e. non-nowhere simple sets.…Read more