Variants of Robinson's essentially undecidable theoryR

  • James P. Jones
  • John C. Shepherdson
Article

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Ehrenfeucht, A., Feferman, S.: Representability of recursively enumberable sets in formal theories. Arch. math. Logik5, 37–41 (1960)CrossRefGoogle Scholar
  2. [2]
    Robinson, J.: Definability and decision problems in arithmetic. J. Symb. Logic14, 98–114 (1949).Google Scholar
  3. [3]
    Shepherdson, J.C.: Representability of recursively enumerable sets in formal theories. Arch. math. Logik5, 119–127 (1960).CrossRefGoogle Scholar
  4. [4]
    Tarski, A., Mostowski, A., Robinson, R.M.: Undecidable theories, p. 53. Amsterdam: North-Holland 1953.Google Scholar
  5. [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. [6]
    Dyson, V.: On the strong representability of number-theoretic functions. Research report, Hughes Aircraft Company, Fullerton, California.Google Scholar

Copyright information

© Verlag W. Kohlhammer 1983

Authors and Affiliations

  • James P. Jones
    • 1
  • John C. Shepherdson
    • 2
  1. 1.University of CalgaryCalgaryCanada
  2. 2.School of MathematicsUniversity WalkBristolEngland

Personalised recommendations