Skip to main content
SpringerLink
Log in

Model-Theoretic Properties of ω-Automatic Structures

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

We investigate structural properties of ω-automatic presentations of infinite structures in order to sharpen our methods to determine whether a given structure is ω-automatic. We apply these methods to show that several classes of structures such as pairing functions and infinite integral domains do not have an ω-automatic model.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Zaid, F.A., Grädel, E., Kaiser, Ł.: The field of reals is not omega-automatic. In: Dürr, C., Wilke, T. (eds.) Proceedings of the International Symposium on Theoretical Aspects of Computer Science, STACS 2012, pp. 577–588 (2012)

    Google Scholar 

  2. Blumensath, A.: Automatic structures. Diploma thesis, RWTH-Aachen (1999)

  3. Blumensath, A., Grädel, E.: Finite presentations of infinite structures: automata and interpretations. Theory Comput. Syst. 37, 641–674 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  4. Büchi, J.R.: On decision method in restricted second order arithmetic. In: Proceedings of the International Congress on Logic, Methodology and Philosophy of Science, pp. 1–11 (1962)

    Google Scholar 

  5. Delhommé, C.: Automaticité des ordinaux et des graphes homogènes. C. R. Acad. Sci., Sér. 1 Math. 339, 5–10 (2004)

    Article  MATH  Google Scholar 

  6. Hjorth, G., Khoussainov, B., Montalbán, A., Nies, A.: From automatic structures to Borel structures. In: Proceedings of the IEEE Symposium on Logic in Computer Science, LICS 2008, pp. 431–441 (2008)

    Chapter  Google Scholar 

  7. Kaiser, Ł., Rubin, S., Bárány, V.: Cardinality and counting quantifiers on ω-automatic structures. In: Proceedings of the International Symposium on Theoretical Aspects of Computer Science, STACS 2008, pp. 385–396. Schloss Dagstuhl—Leibniz-Zentrum für Informatik, Germany (2008)

    Google Scholar 

  8. Khoussainov, B., Nies, A., Rubin, S., Stephan, F.: Automatic structures: Richness and limitations. Log. Methods Comput. Sci. 3(2) (2007)

  9. Kuske, D.: Is Ramsey’s Theorem ω-automatic? In: Proceedings of the International Symposium on Theoretical Aspects of Computer Science, STACS 2010, pp. 537–548 (2010)

    Google Scholar 

  10. Kuske, D., Lohrey, M.: First-order and counting theories of ω-automatic structures. J. Symb. Log. 73, 129–150 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  11. Nies, A.: Describing groups. Bull. Symb. Log. 13(3), 305–339 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  12. Perrin, D., Pin, J.-E.: Semigroups and automata on infinite words. In: Semigroups, Formal Languages and Groups, York, 1993, pp. 49–72. Kluwer Academic, Dordrecht (1995)

    Chapter  Google Scholar 

  13. Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Trans. Am. Math. Soc. 41, 1–35 (1969)

    MathSciNet  Google Scholar 

  14. Ramsey, F.P.: On a problem in formal logic. Proc. Lond. Math. Soc. 3(30), 264–286 (1930)

    Article  MathSciNet  Google Scholar 

  15. Tarski, A.: A Decision Method for Elementary Algebra and Geometry. University of California Press, Berkeley (1951)

    MATH  Google Scholar 

  16. Thomas, W.: Languages, automata, and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 3, pp. 389–455. Springer, New York (1997)

    Chapter  Google Scholar 

  17. Todor, T.: The additive group of the rationals does not have an automatic presentation. J. Symb. Log. 76(4), 1341–1351 (2011)

    Article  MATH  Google Scholar 

  18. Wilke, T.: An algebraic theory for regular languages of finite and infinite words. Int. J. Algebra Comput. 3(4), 447–489 (1993)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematische Grundlagen der Informatik, RWTH Aachen University, Aachen, Germany

    Faried Abu Zaid, Erich Grädel & Wied Pakusa

  2. CNRS & LIAFA, Université Paris Diderot—Paris 7, Paris, France

    Łukasz Kaiser

Authors
  1. Faried Abu Zaid
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Erich Grädel
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Łukasz Kaiser
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Wied Pakusa
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Faried Abu Zaid.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zaid, F.A., Grädel, E., Kaiser, Ł. et al. Model-Theoretic Properties of ω-Automatic Structures. Theory Comput Syst 55, 856–880 (2014). https://doi.org/10.1007/s00224-013-9508-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-013-9508-6

Keywords

Search

Navigation