Abstract
1. The class P of recursively enumerable sets is one of the main objects of investigations in recursion theory. It is well-known that the basic and important results about class P are easily proved when the class is provided with some computable numbering.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
H. G. Rice, ‘On completely recursively enumerable classes and their key arrays’, J. Symb. Logic 21 (1956), 304–308.
A. H. Lachlan, ‘Standard classes of recursively enumerable sets’, Zeit. Math. Logik und Grund. Math. 10 (1964), 23–42.
Λ. И. Maлљцeв, ‘К тeopии вычислимьґҳ семейств объектов’, Алгебра и логика 3 (1964), 5–31
И. A. Лавров, ‘Некотории свііства ретарактов пумерации Поста’, Алгебра и логика 13 (1974), 662–675.
E. L. Post, ‘Recursively enumerable sets of positive integers and their decision problems’, Bull. Amer. Math. Soc. 50 (1944), 284–316.
X. Роджерс, Теория рекурсивных функуий и зффективная вычислимостъ, Μосква, 1972.
R. M. Friedberg, ‘Two recursively enumerable sets of incomparable degrees of unsolvability (solution of Post’s problem 1944)’, Proc. Nat. Acad. Sci., USA 43 (1957), 236–238.
A. A. Мучник, ‘Неразрешимость лроблемы сводимости теории алгоритмов’, Доклады AH CCCP 108 (1956), 194–197.
C. E. M. Yates, ‘Three theorems on the degree of recursively enumerable sets’, Duke Math. J. 32 (1965), 461–468.
C. C. Марченков, ‘Об одпом классе пеполпыҳ множеств’, Матем. заметки 20 (1976), 473–478.
C. G. Jockusch, ‘Semirecursive sets and positive reducibility’, Trans. Amer. Math. Soc. 131 (1968), 420–436.
A. H. Lachlan, ‘On the lattice of recursively enumerable sets’, Trans. Amer. Math. Soc. 130 (1968), 1–37.
A. H. Дегтев, ‘О tt- H и m-степеняҳ’, Алгебра и логика 12 (1973), 143–161.
B. A. Успенский, Лекции о вычислимых функпиях, Москва, 1960.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1979 D. Reidel Publishing Company, Dordrecht, Holland
About this chapter
Cite this chapter
Lavrov, I.A. (1979). Retracts of Post’s Numbering and Effectivization of Quantifiers. In: Hintikka, J., Niiniluoto, I., Saarinen, E. (eds) Essays on Mathematical and Philosophical Logic. Synthese Library, vol 122. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-9825-4_15
Download citation
DOI: https://doi.org/10.1007/978-94-009-9825-4_15
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-009-9827-8
Online ISBN: 978-94-009-9825-4
eBook Packages: Springer Book Archive