Hostname: page-component-7c8c6479df-94d59 Total loading time: 0 Render date: 2024-03-29T09:16:58.618Z Has data issue: false hasContentIssue false

Degrees of unsolvability associated with classes of formalized theories

Published online by Cambridge University Press:  12 March 2014

Solomon Feferman*
Affiliation:
University of California, Berkeley

Extract

In his well-known paper [11], Post founded a general theory of recursively enumerable sets, which had its metamathematical source in questions about the decision problem for deducibility in formal systems. However, in centering attention on the notion of degree of unsolvability, Post set a course for his theory which has rarely returned to this source. Among exceptions to this tendency we may mention, as being closest to the problems considered here, the work of Kleene in [8] pp. 298–316, of Myhill in [10], and of Uspenskij in [15]. It is the purpose of this paper to make some further contributions towards bridging this gap.

From a certain point of view, it may be argued that there is no real separation between metamathematics and the theory of recursively enumerable sets. For, if the notion of formal system is construed in a sufficiently wide sense, by taking as ‘axioms’ certain effectively found members of a set of ‘formal objects’ and as ‘proofs’ certain effectively found sequences of these objects, then the set of ‘provable statements’ of such a system may be identified, via Gödel's numbering technique, with a recursively enumerable set; and conversely, each recursively enumerable set is identified in this manner with some formal system (cf. [8] pp. 299–300 and 306). However, the pertinence of Post's theory is no longer clear when we turn to systems formalized within the more conventional framework of the first-order predicate calculus. It is just this restriction which serves to clarify the difference in spirit of the two disciplines.

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1957

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

BIBLIOGRAPHY

[1]Church, A. and Quine, W. V., Some theorems on definability and decidability, this Journal, vol. 17 (1952), pp. 179187.Google Scholar
[2]Craig, W., On axiomatizability within a system, this Journal, vol. 18 (1953), pp. 3032.Google Scholar
[3]Craig, W. and Quine, W. V., On reduction to a symmetric relation, this Journal, vol. 17 (1952), p. 188.Google Scholar
[4]Dekker, J. C. E., Two notes on recursively enumerable sets, Proceedings of the American Mathematical Society, vol. 4 (1953), pp. 495501.CrossRefGoogle Scholar
[5]Feferman, S., Degrees of unsolvability correlated to theories with standard formalization, abstract, Bulletin of the American Mathematical Society, vol. 62 (1956), p. 412.Google Scholar
[6]Friedberg, R. M., The solution of Post's problem by the construction of two recursively enumerable sets of incomparable degree of unsolvability, abstract, Bulletin of the American Mathematical Society, vol. 62 (1956), p. 260.Google Scholar
[7]Hilbert, D. and Bernays, P., Grundlagen der Mathematik, vol. 1. Berlin, 1934. XII + 471 pp.Google Scholar
[8]Kleene, S. C., Introduction to metamathematlcs, Amsterdam, Groningen, New York and Toronto, 1952, X + 550 pp.Google Scholar
[9]Mučnik, A. A., Nérazréš imost′ problémy svodimosti téorii algoritmov (Negative answer to the problem of reducibility of the theory of algorithms), Doklady Akadémii Nauk SSSR, vol. 108 (1956), pp. 194197.Google Scholar
[10]Myhill, J., Creative sets, Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 1 (1955), pp. 97108.CrossRefGoogle Scholar
[11]Post, E., Recursively enumerable sets of positive integers and their decision problems, Bulletin of the American Mathematical Society, vol. 50 (1944), pp. 284316.CrossRefGoogle Scholar
[12]Rosser, J. B., Extensions of some theorems of Gödel and Church, this Journal, vol. 1 (1936), pp. 8791.Google Scholar
[13]Szmielew, W. and Tarski, A., Mutual interpretability of some essentially undecidable theories, abstract, Proceedings of the International Congress of Mathematicians, (Cambridge, Mass., 1950), 1952, vol. 1, p. 734.Google Scholar
[14]Tarski, A., Mostowski, A. and Robinson, R. M., Undecidable theories, Amsterdam, 1953, XI + 98 pp.Google Scholar
[15]Uspénskij, V. A., Téoréma Gëdéla i téoriá algoritmov (Gödel's theorem and the theory of algorithms), Doklady Akadémii Nauk SSSR, vol. 91 (1953), pp. 737740.Google Scholar