Skip to main content
Log in

A note on undecidable extensions of monadic second order successor arithmetic

  • Published:
Archiv für mathematische Logik und Grundlagenforschung Aims and scope Submit manuscript

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

Access this article

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

Instant access to the full article PDF.

References

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

  2. Elgot, C.C., Rabin, M.O.: Decidability and undecidability of second (first) order theories of (generalized) successor. J. Symb. Logic31 (1966), 169–181.

    Google Scholar 

  3. Robinson, R.M.: Restricted set-theoretical definitions in arithmetic. Proc. AMS9 (1958), 238–242.

    Google Scholar 

  4. Siefkes, D.: Undecidable extensions of monadic second order successor arithmetic. Zeitschr. f. Math. Logik u. Grundl. d. Math.17 (1971), 385–394.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Thomas, W. A note on undecidable extensions of monadic second order successor arithmetic. Arch math Logik 17, 43–44 (1975). https://doi.org/10.1007/BF02280812

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation