Computable Structure and NonStructure Theorems
 S. S. Goncharov,
 J. F. Knight
 … show all 2 hide
Purchase on Springer.com
$39.95 / €34.95 / £29.95*
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Abstract
In a lecture in Kazan (1977), Goncharov dubbed a number of problems regarding the classification of computable members of various classes of structures. Some of the problems seemed likely to have nice answers, while others did not. At the end of the lecture, Shore asked what would be a convincing negative result. The goal of the present article is to consider some possible answers to Shore's question. We consider structures Д of some computable language, whose universes are computable sets of constants. In measuring complexity, we identify Д with its atomic diagram D(Д), which, via the Gödel numbering, may be treated as a subset of ω. In particular, Д is computable if D(Д) is computable. If K is some class, then K^{c} denotes the set of computable members of K. A computable characterization for K should separate the computable members of K from other structures, that is, those that either are not in K or are not computable. A computable classification (structure theorem) should describe each member of K^{c} up to isomorphism, or other equivalence, in terms of relatively simple invariants. A computable nonstructure theorem would assert that there is no computable structure theorem. We use three approaches. They all give the “correct” answer for vector spaces over Q, and for linear orderings. Under all of the approaches, both classes have a computable characterization, and there is a computable classification for vector spaces, but not for linear orderings. Finally, we formulate some open problems.
 W. Hodges, “What is a structure theory?,” Bull. London Math. Soc., 19, No. 3(78) 209237 (1987).
 S. Shelah, “Classification of first order theories which have a structure theorem,” Bull. Am. Math. Soc., 12, No. 2, 227232 (1985).
 H. Friedman and L. Stanley, “On Borel reducibility theory for classes of computable structures,” J. Symb. Log., 54, No. 3, 894914 (1989).
 C. J. Ash and J. F. Knight, Computable Structures and the Hyperarithmetical Hierarchy, Elsevier, Amsterdam (2000).
 D. Scott, “Logic with denumerably long formulas and finite strings of quantifiers,” in The Theory of Models, J. Addison, L. Henkin, and A. Tarski (eds.), NorthHolland, Amsterdam (1970), pp. 329341.
 H. J. Keisler, Model Theory for Infinitary Logic, NorthHolland, Amsterdam (1971).
 H. Rogers, Theory of Recursive Functions and Effective Computability, McGrawHill, New York (1967).
 J. Harrison, “Recursive pseudo wellorderings,” Trans. Am. Math. Soc., 131, No. 2, 526543 (1968).
 G. E. Sacks, Higher Type Recursion Theory, Springer, Berlin (1990).
 S. S. Goncharov, “Autostability and computable families of constructivizations,” Algebra Logika, 14, No. 6, 647680 (1975).
 S. S. Goncharov, “The quantity of nonautoequivalent constructivizations,” Algebra Logika, 16, No. 6, 257282 (1977).
 C. J. Ash, “Categoricity in hyperarithmetical degrees,” Ann. Pure Appl. Log., 34, No. 1, 114 (1987).
 E. LopezEscobar, “An addition to 'On definable wellorderings',” Fund. Math., 59, No. 3, 299300 (1966).
 M. Morley, “Omitting classes of elements,” in The Theory of Models, M. Addison, L. Henkin, and A. Tarski (eds.), NorthHolland, Amsterdam (1970), pp. 265273.
 D. R. Hirschfeldt, B. Khoussainov, R. A. Shore, and A. M. Slinco, “Degree spectra and computable dimensions in algebraic structures,” Preprint.
 C. J. Ash and J. F. Knight, “Pairs of recursive structures,” Ann. Pure Appl. Log., 46, No. 3, 211234 (1990).
 C. J. Ash, C. G. Jockusch, and J. F. Knight, “Jumps of orderings,” Trans. Am. Math. Soc., 319, No. 2, 573599 (1990).
 C. J. Ash, “A construction for recursive linear orderings,” J. Symb. Log., 56, No. 2, 673683 (1991).
 C. J. Ash, “Recursive labelling systems and stability of recursive structures in hyperarithmetical degrees,” Trans. Am. Math. Soc., 298, No. 2, 497514 (1986); Corrections: Ibid., 310, No. 2, 851 (1988).
 A. T. Nurtazin, “Computable classes and algebraic criteria for autostability,” Ph.D. Thesis, Institute of Mathematics and Mechanics, AlmaAta (1974).
 C. G. Jockusch and R. I. Soare, “Degrees of orderings not isomorphic to recursive linear orderings,” Ann. Pure Appl. Log., 52, Nos. 1/2, 3964 (1991).
 Title
 Computable Structure and NonStructure Theorems
 Journal

Algebra and Logic
Volume 41, Issue 6 , pp 351373
 Cover Date
 20021101
 DOI
 10.1023/A:1021758312697
 Print ISSN
 00025232
 Online ISSN
 15738302
 Publisher
 Kluwer Academic PublishersPlenum Publishers
 Additional Links
 Topics
 Keywords

 computable characterization
 computable classification
 structure theorem
 nonstructure theorem
 Industry Sectors
 Authors

 S. S. Goncharov ^{(1)}
 J. F. Knight ^{(2)}
 Author Affiliations

 1. Institute of Mathematics SB RAS, Akademika Koptyuga Prospekt, Novosibirsk, 630090, Russia
 2. Notre Dame University, Notre Dame, USA