Model Theoretic Complexity of Automatic Structures (Extended Abstract)

  • Bakhadyr Khoussainov
  • Mia Minnes
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4978)

Abstract

We study the complexity of automatic structures via well-established concepts from both logic and model theory, including ordinal heights (of well-founded relations), Scott ranks of structures, and Cantor-Bendixson ranks (of trees). We prove the following results: 1) The ordinal height of any automatic well-founded partial order is bounded by ωω; 2) The ordinal heights of automatic well-founded relations are unbounded below \(\omega_{1}^{CK}\); 3) For any infinite computable ordinal α, there is an automatic structure of Scott rank at least α. Moreover, there are automatic structures of Scott rank \(\omega_1^{CK}, \omega_1^{CK}+1\); 4) For any ordinal \(\alpha<\omega_1^{CK}\), there is an automatic successor tree of Cantor-Bendixson rank α.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Benedikt, M., Libkin, L.: Tree extension algebras: Logics, automata, and query languages. In: Proceedings of LICS 2002, pp. 203–212 (2002)Google Scholar
  2. 2.
    Bennett, C.H.: Logical Reversibility of Computation. IBM Journal of Research and Development, 525–532 (1973)Google Scholar
  3. 3.
    Blaas, A., Gurevich, Y.: Program Termination and Well Partial Orderings. ACM Transactions on Computational Logic, 1–25 (2006)Google Scholar
  4. 4.
    Büchi, J.R.: Weak second-order arithmetic and finite automata. Zeitschrift Math. Logik und Grundlagen det Mathematik, 66–92 (1960)Google Scholar
  5. 5.
    Büchi, J.R.: On a decision method in restricted second-order arithmetic. In: Nagel, E., Suppes, P., Tarski, A. (eds.) Proc. International Congress on Logic, Methodology and Philosophy of Science, 1960, pp. 1–12. Stanford University Press (1962)Google Scholar
  6. 6.
    Calvert, W., Goncharov, S.S., Knight, J.F.: Computable structures of Scott rank \({\omega}_1^{CK}\) in familiar classes. In: Advances in Logic (Proceedings of the North Texas Logic Conference). Contemporary Mathematics, vol. 425, pp. 49–66. American Mathematical Society (2007)Google Scholar
  7. 7.
    Delhommé, C.: Automaticité des ordinaux et des graphes homogènes. C.R. Acadèmie des sciences Paris, Ser. I 339, 5–10 (2004)MATHGoogle Scholar
  8. 8.
    Eilenberg, S.: Automata, Languages, and Machines (Vol. A). Academic Press, New York (1974)MATHGoogle Scholar
  9. 9.
    Epstein, D.B.A., et al.: Word Processing in Groups, A.K. Peters Ltd. (Natick, Massachusetts) (1992)Google Scholar
  10. 10.
    Goncharov, S.S., Knight, J.F.: Computable structure and non-structure theorems. Algebra and Logic 41, 351–373 (2002)CrossRefMathSciNetGoogle Scholar
  11. 11.
    Harizanov, V.S.: Pure Computable Model Theory. In: Yu. Ershov, S., Goncharov, A., Nerode, J. (eds.) Handbook of Recursive Mathematics, pp. 3–114. North-Holland, Amsterdam (1998)CrossRefGoogle Scholar
  12. 12.
    Harrison, J.: Recursive Pseudo Well-Orderings. Transactions of the American Mathematical Society 131(2), 526–543 (1968)CrossRefMathSciNetMATHGoogle Scholar
  13. 13.
    Hodgson, B.R.: On Direct Products of Automaton Decidable Theories. Theoretical Computer Science 19, 331–335 (1982)CrossRefMathSciNetMATHGoogle Scholar
  14. 14.
    Khoussainov, B., Nerode, A.: Automatic presentations of structures. In: Leivant, D. (ed.) LCC 1994. LNCS, vol. 960, pp. 367–392. Springer, Heidelberg (1995)Google Scholar
  15. 15.
    Khoussainov, B., Shore, R.A.: Effective Model Theory: The Number of Models and Their Complexity. In: Cooper, S.B., Truss, J.K. (eds.) Models and Computability, Invited Papers from LC 1997. LMSLNS, vol. 259, pp. 193–240. Cambridge University Press, Cambridge, England (1999)Google Scholar
  16. 16.
    Khoussainov, B., Rubin, S., Stephan, F.: On automatic partial orders. In: Proceedings of 18th LICS, pp. 168–177 (2003)Google Scholar
  17. 17.
    Khoussainov, B., Rubin, S., Stephan, F.: Automatic linear orders and trees. ACM Transactions on Computational Logic 6(4), 675–700 (2005)CrossRefMathSciNetGoogle Scholar
  18. 18.
    Knight, J.F., Millar, J.: Computable Structures of Rank \(\omega_1^{CK}\). Journal of Mathematical Logic; posted on arXiv 25 (August 2005) (submitted)Google Scholar
  19. 19.
    Lohrey, M.: Automatic structures of bounded degree. In: Y. Vardi, M., Voronkov, A. (eds.) LPAR 2003. LNCS (LNAI), vol. 2850, pp. 344–358. Springer, Heidelberg (2003)Google Scholar
  20. 20.
    Rabin, M.O.: Decidability of Second-Order Theories and Automata on Infinite Trees. Transactions of the American Mathematical Society 141, 1–35 (1969)CrossRefMathSciNetMATHGoogle Scholar
  21. 21.
    Rubin, S.: Automatic Structures, PhD Thesis, University of Auckland (2004)Google Scholar
  22. 22.
    Scott, D.: Logic with Denumerably Long Formulas and Finite Strings of Quantifiers. In: Addison, J., Henkin, L., Tarski, A. (eds.) The Theory of Models, pp. 329–341. North-Holland, Amsterdam (1965)Google Scholar
  23. 23.
    Vardi, M.Y., Wolper, P.: Automata-Theoretic Techniques for Modal Logics of Programs. In: Proceedings of 16th STOC, pp. 446–456 (1984)Google Scholar
  24. 24.
    Vardi, M.Y.: An Automata-Theoretic Approach to Linear Temporal Logic. In: Moller, F., Birtwistle, G. (eds.) Logics for Concurrency. LNCS, vol. 1043, pp. 238–266. Springer, Heidelberg (1996)Google Scholar
  25. 25.
    Vardi, M.Y.: Model Checking for Database Theoreticians. In: Proceedings of ICDL, vol. 5 (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Bakhadyr Khoussainov
    • 1
  • Mia Minnes
    • 2
  1. 1.Department of Computer ScienceUniversity of AucklandAucklandNew Zealand
  2. 2.Mathematics DepartmentCornell University, IthacaNew York

Personalised recommendations