Theories of Automatic Structures and Their Complexity

Authors:
Dietrich Kuske
Affiliations:
Institut für Informatik, Universität Leipzig, Germany
Venue:
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Year:
2009

Citing 8
Cited 0

Easy multiplications. I. The realm of Kleene's theorem

Information and Computation
Automatic semigroups

Theoretical Computer Science
Word Processing in Groups

Word Processing in Groups
Automatic Presentations of Structures

LCC '94 Selected Papers from the International Workshop on Logical and Computational Complexity
Automatic Structures

LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Automatic linear orders and trees

ACM Transactions on Computational Logic (TOCL)
Invariants of automatic presentations and semi-synchronous transductions

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Automatic presentations for finitely generated groups

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

For automatic structures, several logics have been shown decidable: first-order logic, its extension by the infinity quantifier, by modulo-counting quantifiers, and even by a restricted form of second-order quantification. We review these decidability proofs. As a new result, we determine the data, the expression, and the combined complexity of quantifier-classes for first-order logic. Finally, we also recall that first-order logic becomes elementary decidable for automatic structures of bounded degree.