Skip to main content
Log in

Variants of Robinson's essentially undecidable theoryR

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

Abstract

Cobham has observed that Raphael Robinson's well known essentially undecidable theoryR remains essentially undecidable if the fifth axiom scheme\(\left( {x \leqq \bar n \vee \bar n \leqq x} \right)\) is omitted. We note that whether the resulting system is in a sense “minimal essentially undecidable” depends on what the basic constants are taken to be. We give an essentially undecidable theory based on three axiom schemes involving only multiplication and less than or equals.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ehrenfeucht, A., Feferman, S.: Representability of recursively enumberable sets in formal theories. Arch. math. Logik5, 37–41 (1960)

    Article  Google Scholar 

  2. Robinson, J.: Definability and decision problems in arithmetic. J. Symb. Logic14, 98–114 (1949).

    Google Scholar 

  3. Shepherdson, J.C.: Representability of recursively enumerable sets in formal theories. Arch. math. Logik5, 119–127 (1960).

    Article  Google Scholar 

  4. Tarski, A., Mostowski, A., Robinson, R.M.: Undecidable theories, p. 53. Amsterdam: North-Holland 1953.

    Google Scholar 

  5. Vaught, R.L.: On a theorem of Cobham concerning undecidable theories. In: Nagel, E., Suppes, P., Tarksi, A. (eds.): Logic, Methodology, and Philosophy of Science, p. 18. Proceedings of the 1960 International Congress. Stanford, CA: Stanford University Press 1962.

    Google Scholar 

  6. Dyson, V.: On the strong representability of number-theoretic functions. Research report, Hughes Aircraft Company, Fullerton, California.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jones, J.P., Shepherdson, J.C. Variants of Robinson's essentially undecidable theoryR . Arch math Logik 23, 61–64 (1983). https://doi.org/10.1007/BF02023013

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation