Automatic structures: richness and limitations

This paper studies the existence of automatic presentations for various algebraic structures. The automatic Boolean algebras are characterised, and it is proven that the free Abelian group of infinite rank and many Fraisse limits do not have automatic presentations. In particular, the countably infinite random graph and the universal partial order do not have automatic presentations. Furthermore, no infinite integral domain is automatic. The second topic of the paper is the isomorphism problem. We prove that the complexity of the isomorphism problem for the class of all automatic structures is /spl Sigma//sub 1//sup 1/-complete.

[1]  Chen C. Chang,et al.  Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .

[2]  Frank Neven,et al.  Logical definability and query languages over unranked trees , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[3]  Achim Blumensath,et al.  Automatic structures , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).

[4]  David B. A. Epstein,et al.  Word processing in groups , 1992 .

[5]  S. Goncharov,et al.  Computable Structure and Non-Structure Theorems , 2002 .

[6]  C. C. Elgot,et al.  Sets recognized by n-tape automata , 1969 .

[7]  Anil Nerode,et al.  Automatic Presentations of Structures , 1994, LCC.

[8]  Thomas Schwentick,et al.  A model-theoretic approach to regular string relations , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

[9]  Charles H. Bennett,et al.  Logical reversibility of computation , 1973 .

[10]  Sasha Rubin,et al.  Some results on automatic structures , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[11]  Michael Benedikt,et al.  Tree extension algebras: logics, automata, and query languages , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[12]  Frank Stephan,et al.  Automatic linear orders and trees , 2005, TOCL.

[13]  C. Delhommé.  Automaticité des ordinaux et des graphes homogènes , 2004 .