×

zbMATH — the first resource for mathematics

Recursively enumerable classes and their application to recursive sequences of formal theories. (English) Zbl 0242.02046

MSC:
03D60 Computability and recursion theory on ordinals, admissible sets, etc.
03D25 Recursively (computably) enumerable sets and degrees
PDF BibTeX XML Cite
Full Text: DOI EuDML
References:
[1] Dekker, J. C. E., and J. Myhill, Some theorems on classes of recursively enumerable sets.Trans. Amer. Math. Soc. 89, No. 1 (1958), pp. 25–59. · Zbl 0083.00302 · doi:10.1090/S0002-9947-1958-0097310-7
[2] Ehrenfeucht, A., Two theories with axioms built by means of pleonasms.The Journal of Symbolic Logic 22, No. 1 (1957), pp. 36–38. · Zbl 0078.24402 · doi:10.2307/2964056
[3] Friedberg, R., Three theorems on recursive enumeration.The Journal of Symbolic Logic 23, No. 3 (1958), pp. 309–316. · Zbl 0088.01601 · doi:10.2307/2964290
[4] Kleene, S. C., Introduction to metamathematics. New York, Van Nostrand, Amsterdam, North Holland Publishing Co. and Groningen, Noordhoff, 1952, x + 550 pp. · Zbl 0047.00703
[5] Pour-El, M. B.,Review of [3],The Journal of Symbolic Logic 25, No. 2 (1960), pp. 165–166.
[6] Tarski, A., A. Mostowski, and R. M. Robinson, Undecidable theories. Studies in Logic and the Foundations of Mathematics North Holland-Publishing Co., Amsterdam, 1953, 98 pp. · Zbl 0053.00401
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.