Degree spectra and computable dimensions in algebraic structures

✍ Scribed by Denis R. Hirschfeldt; Bakhadyr Khoussainov; Richard A. Shore; Arkadii M. Slinko

• Publisher: Elsevier Science
• Year: 2002
• Tongue: English
• Weight: 339 KB
• Volume: 115
• Category: Article
• ISSN: 0168-0072
• DOI: 10.1016/s0168-0072(01)00087-2

✦ Synopsis

Whenever a structure with a particularly interesting computability-theoretic property is found, it is natural to ask whether similar examples can be found within well-known classes of algebraic structures, such as groups, rings, lattices, and so forth. One way to give positive answers to this question is to adapt the original proof to the new setting. However, this can be an unnecessary duplication of e ort, and lacks generality. Another method is to code the original structure into a structure in the given class in a way that is e ective enough to preserve the property in which we are interested. In this paper, we show how to transfer a number of computability-theoretic properties from directed graphs to structures in the following classes: symmetric, irre exive graphs; partial orderings; lattices; rings (with zero-divisors); integral domains of arbitrary characteristic; commutative semigroups; and 2-step nilpotent groups. This allows us to show that several theorems about degree spectra of relations on computable structures, nonpreservation of computable categoricity, and degree spectra of structures remain true when we restrict our attention to structures in any of the classes on this list. The codings we present are general enough to be viewed as establishing that the theories mentioned above are computably complete in the sense that, for a wide range of computability-theoretic nonstructure type properties, if there are any examples of structures with such properties then there are such examples that are models of each of these theories.