Skip to main content

Undecidability of extensions of the monadic first-order theory of successor and two-dimensional finite automata

  • 241 Accesses

Part of the Lecture Notes in Mathematics book series (LNM,volume 891)

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   44.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   59.95
Price excludes VAT (Canada)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. R. Büchi, Weak second order arithmetic and finite automata, Z. Math. Logik Grundlagen Math., 6 (1960) 66–72.

    CrossRef  MATH  MathSciNet  Google Scholar 

  2. J. R. Büchi, On a decision method in restricted second order arithmetic, Proc. Internat. Congr. Logic, Method. and Philos. Sci. 1960, Stanford Univ. Press, 1962, 1–11.

    Google Scholar 

  3. C. C. Elgot and M. O. Rabin, Decidability and undecidability of second (first) order theories of (generalized) successor, J. Symbolic Logic, 31 (1966) 169–181.

    CrossRef  MATH  Google Scholar 

  4. A. Nakamura, On causal ω2-systems, J. of Computer and System Sciences, 10 (1975) 235–265.

    CrossRef  MathSciNet  Google Scholar 

  5. H. Ono and A. Nakamura, Undecidability of the first-order arithmetic A[P (x), 2x,x+1], J. of Computer and System Sciences, 18 (1979) 243–253.

    CrossRef  MATH  MathSciNet  Google Scholar 

  6. H. Putnam, Decidability and essential undecidability, J. Symbolic Logic, 22 (1957) 39–54.

    CrossRef  MATH  MathSciNet  Google Scholar 

  7. M. O. Rabin, Decidability of second-order theories and automata on infinite trees, Trans. Amer. Math. Soc., 141 (1969) 1–35.

    MATH  MathSciNet  Google Scholar 

  8. R. M. Robinson, Restricted set-theoretical definitions in arithmetic, Proc. Amer. Math. Soc., 9 (1958) 238–242.

    CrossRef  MATH  MathSciNet  Google Scholar 

  9. D. Siefkes, Undecidable extensions of monadic second order successor arithmetic, Z. Math. Logik Grundlagen Math., 17 (1971) 385–394.

    CrossRef  MATH  MathSciNet  Google Scholar 

  10. W. Thomas, A note on undecidable extensions of monadic second order successor arithmetic, Arch. math. Logik, 17 (1975) 43–44.

    CrossRef  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1981 Springer-Verlag

About this paper

Cite this paper

Ono, H., Nakamura, A. (1981). Undecidability of extensions of the monadic first-order theory of successor and two-dimensional finite automata. In: Müller, G.H., Takeuti, G., Tugué, T. (eds) Logic Symposia Hakone 1979, 1980. Lecture Notes in Mathematics, vol 891. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0090984

Download citation

  • DOI: https://doi.org/10.1007/BFb0090984

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11161-0

  • Online ISBN: 978-3-540-38633-9

  • eBook Packages: Springer Book Archive