Skip to main content
Log in

Two Undecidable Problems of Analysis

  • Published:
Minds and Machines 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

  • Davis, M., Putnam, H. and Robinson, J. (1961), 'The Decision Problem for Exponential Diophantine Equations', Annals of Mathematics 74, pp. 425–436.

    Google Scholar 

  • Bochner, G. and Martin W.T. (1948), Several Complex Variables, Princeton, NJ: Princeton University Press.

    Google Scholar 

  • Davis, M. (1958), Computability and Unsolvability, New York: McGraw-Hill.

    Google Scholar 

  • Smullyan, R. (1961), Theory of Formal Systems, Princeton, NJ: Princeton University Press.

    Google Scholar 

  • Hermes, H. (1961), Aufzählbarkeit, Entscheidbarkeit, Berechenbarkeit, Berlin: Springer.

    Google Scholar 

  • Robinson, S.J. (1952), 'Existential Definability in Arithmetic', Trans. Amer. Math. Soc. 1, pp. 437–449.

    Google Scholar 

  • Hancock, H. (1958), Theory of Elliptic Functions, Dover Publishing.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Scarpellini, B. Two Undecidable Problems of Analysis. Minds and Machines 13, 49–77 (2003). https://doi.org/10.1023/A:1021381032553

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1021381032553

Keywords

Navigation