Skip to main content
SpringerLink
Log in

Incompleteness Theorems, Large Cardinals, and Automata over Finite Words

  • Conference paper
  • First Online:
Theory and Applications of Models of Computation (TAMC 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10185))

  • 799 Accesses

Abstract

We prove that one can construct various kinds of automata over finite words for which some elementary properties are actually independent from strong set theories like \(T_n =:\mathbf{ZFC} +\) “There exist (at least) n inaccessible cardinals”, for integers \(n\ge 0\). In particular, we prove independence results for languages of finite words generated by context-free grammars, or accepted by 2-tape or 1-counter automata. Moreover we get some independence results for weighted automata and for some related finitely generated subsemigroups of the set \(\mathbb {Z}^{3\times 3}\) of 3-3 matrices with integer entries. Some of these latter results are independence results from the Peano axiomatic system PA.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Berstel, J.: Transductions and context free languages. Teubner Studienbücher Informatik (1979). http://www-igm.univ-mlv.fr/~berstel/

  2. Drake, F.R.: Set Theory, An Introduction to Large cardinals. Studies in Logic and the Foundations of Mathematics, vol. 76. North-Holland, Amsterdam (1974)

    MATH  Google Scholar 

  3. Ebbinghaus, H.-D., Flum, J., Thomas, W.: Mathematical Logic. Undergraduate Texts in Mathematics, 2nd edn. Springer, New York (1994). Translated from the German by Margit Meßmer

    Book  MATH  Google Scholar 

  4. Finkel, O.: Undecidability of topological and arithmetical properties of infinitary rational relations. RAIRO-Theoret. Inf. Appl. 37(2), 115–126 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  5. Finkel, O.: The complexity of infinite computations in models of set theory. Logical Methods Comput. Sci. 5(4:4), 1–19 (2009)

    MathSciNet  MATH  Google Scholar 

  6. Finkel, O.: Some problems in automata theory which depend on the models of set theory. RAIRO-Theoret. Inf. Appl. 45(4), 383–397 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  7. Finkel, O.: Incompleteness theorems, large cardinals, and automata over infinite words. In: Halldórsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9135, pp. 222–233. Springer, Heidelberg (2015). doi:10.1007/978-3-662-47666-6_18

    Chapter  Google Scholar 

  8. Friedman, H.M.: My forty years on his shoulders. In: Gödel, K. (ed.) The Foundations of Mathematics, pp. 399–432. Cambridge Univ. Press, Cambridge (2011)

    Google Scholar 

  9. Gentzen, G.: Die Widerspruchsfreiheit der reinen Zahlentheorie. Math. Ann. 112(1), 493–565 (1936)

    Article  MathSciNet  MATH  Google Scholar 

  10. Gödel, K.: On formally undecidable propositions of Principia Mathematica and related systems (1963). Translated by B. Meltzer, with an introduction by R. B. Braithwaite. Basic Books Inc., Publishers, New York

    Google Scholar 

  11. Hartmanis, J.: Independence results about context-free languages and lower bounds. Inf. Process. Lett. 20(5), 241–248 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  12. Harju, T.: Decision questions on integer matrices. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds.) DLT 2001. LNCS, vol. 2295, pp. 57–68. Springer, Heidelberg (2002). doi:10.1007/3-540-46011-X_5

    Chapter  Google Scholar 

  13. Halava, V., Harju, T.: Mortality in matrix semigroups. Am. Math. Mon. 108(7), 649–653 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  14. Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Series in Computer Science. Addison-Wesley Publishing Co., Reading (2001)

    MATH  Google Scholar 

  15. Horská, A.: Where is the Gödel-point Hiding: Gentzen’s Consistency Proof of 1936 and His Representation of Constructive Ordinals. Springer Briefs in Philosophy. Springer, Cham (2014)

    Book  MATH  Google Scholar 

  16. Ibarra, O.H.: Restricted one-counter machines with undecidable universe problems. Math. Syst. Theory 13, 181–186 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  17. Jech, T.: Set Theory, 3rd edn. Springer, Heidelberg (2002)

    MATH  Google Scholar 

  18. Joseph, D., Young, P.: Independence results in computer science? J. Comput. Syst. Sci. 23(2), 205–222 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  19. Kanamori, A.: The Higher Infinite. Springer, Heidelberg (1997)

    Book  MATH  Google Scholar 

  20. Kanamori, A., McAloon, K.: On Gödel incompleteness and finite combinatorics. Ann. Pure Appl. Logic 33(1), 23–41 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  21. Kunen, K.: Set Theory. An Introduction to Independence Proofs. Studies in Logic and the Foundations of Mathematics, vol. 102. North-Holland Publishing Co., Amsterdam, New York (1980)

    MATH  Google Scholar 

  22. Poizat, B.: A Course in Model Theory: An Introduction to Contemporary Mathematical Logic. Universitext. Springer, New York (2000). Translated from the French by Moses Klein and revised by the Author

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut de Mathématiques de Jussieu - Paris Rive Gauche, CNRS et Université Paris 7, Paris, France

    Olivier Finkel

Authors
  1. Olivier Finkel
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Olivier Finkel .

Editor information

Editors and Affiliations

  1. Anna University, Chennai, India

    T.V. Gopal

  2. Universität Bern , Bern, Switzerland

    Gerhard Jäger

  3. Universität Bern , Bern, Switzerland

    Silvia Steila

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Finkel, O. (2017). Incompleteness Theorems, Large Cardinals, and Automata over Finite Words. In: Gopal, T., Jäger , G., Steila, S. (eds) Theory and Applications of Models of Computation. TAMC 2017. Lecture Notes in Computer Science(), vol 10185. Springer, Cham. https://doi.org/10.1007/978-3-319-55911-7_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-55911-7_17

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-55910-0

  • Online ISBN: 978-3-319-55911-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation