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.
Similar content being viewed by others
References
Ehrenfeucht, A., Feferman, S.: Representability of recursively enumberable sets in formal theories. Arch. math. Logik5, 37–41 (1960)
Robinson, J.: Definability and decision problems in arithmetic. J. Symb. Logic14, 98–114 (1949).
Shepherdson, J.C.: Representability of recursively enumerable sets in formal theories. Arch. math. Logik5, 119–127 (1960).
Tarski, A., Mostowski, A., Robinson, R.M.: Undecidable theories, p. 53. Amsterdam: North-Holland 1953.
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.
Dyson, V.: On the strong representability of number-theoretic functions. Research report, Hughes Aircraft Company, Fullerton, California.
Author information
Authors and Affiliations
Rights 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
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02023013