Some properties of pseudo-complements of recursively enumerable sets
HTML articles powered by AMS MathViewer
- by Robert A. Di Paola PDF
- Trans. Amer. Math. Soc. 121 (1966), 296-308 Request permission
References
- Martin Davis, Computability and unsolvability, McGraw-Hill Series in Information Processing and Computers, McGraw-Hill Book Co., Inc., New York-Toronto-London, 1958. MR 0124208 —, On the theory of recursive unsolvability, Doctoral dissertation, Princeton University, Princeton, N. J., 1950. —, Pseudo-complements of recursively enumerable sets, Abstract 299, Bull. Amer. Math. Soc. 60 (1954), 169-170.
- Martin Davis, Arithmetical problems and recursively enumerable predicates, J. Symbolic Logic 18 (1953), 33–41. MR 55281, DOI 10.2307/2266325 R. A. Di Paola, On pseudo-complements of recursively enumerable sets, Doctoral dissertation, Belfer Graduate School of Science, Yeshiva University, New York, 1964.
- A. Ehrenfeucht and S. Feferman, Representability of recursively enumerable sets in formal theories, Arch. Math. Logik Grundlag. 5 (1960), 37–41. MR 125791, DOI 10.1007/BF01977641
- S. Feferman, Arithmetization of metamathematics in a general setting, Fund. Math. 49 (1960/61), 35–92. MR 147397, DOI 10.4064/fm-49-1-35-92
- Solomon Feferman, Transfinite recursive progressions of axiomatic theories, J. Symbolic Logic 27 (1962), 259–316. MR 172792, DOI 10.2307/2964649
- Solomon Feferman, Degrees of unsolvability associated with classes of formalized theories, J. Symbolic Logic 22 (1957), 161–175. MR 98675, DOI 10.2307/2964178
- Stephen Cole Kleene, Introduction to metamathematics, D. Van Nostrand Co., Inc., New York, N. Y., 1952. MR 0051790
- S. C. Kleene, On the forms of the predicates in the theory of constructive ordinals. II, Amer. J. Math. 77 (1955), 405–428. MR 70595, DOI 10.2307/2372632
- John Myhill, Creative sets, Z. Math. Logik Grundlagen Math. 1 (1955), 97–108. MR 71379, DOI 10.1002/malq.19550010205
- Hilary Putnam and Raymond M. Smullyan, Exact separation of recursively enumerable sets within theories, Proc. Amer. Math. Soc. 11 (1960), 574–577. MR 120150, DOI 10.1090/S0002-9939-1960-0120150-1
- Hartley Rogers Jr., Computing degrees of unsolvability, Math. Ann. 138 (1959), 125–140. MR 114752, DOI 10.1007/BF01342939 J. B. Rosser, Extensions of some theorems of Gödel and Church, J. Symbolic Logic 1 (1936), 87-91.
- Raymond M. Smullyan, Theory of formal systems, Annals of Mathematics Studies, No. 47, Princeton University Press, Princeton, N.J., 1961. MR 0121300, DOI 10.1515/9781400882007
- Alfred Tarski, Undecidable theories, Studies in Logic and the Foundations of Mathematics, North-Holland Publishing Co., Amsterdam, 1953. In collaboration with Andrzej Mostowski and Raphael M. Robinson. MR 0058532
Additional Information
- © Copyright 1966 American Mathematical Society
- Journal: Trans. Amer. Math. Soc. 121 (1966), 296-308
- MSC: Primary 02.70
- DOI: https://doi.org/10.1090/S0002-9947-1966-0195722-9
- MathSciNet review: 0195722