Representability of partial recursive functions in formal theories
HTML articles powered by AMS MathViewer
- by William E. Ritter PDF
- Proc. Amer. Math. Soc. 18 (1967), 647-651 Request permission
References
- 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 R. W. Ritchie and P. R. Young, Strong representability of partial recursive functions, Notices Amer. Math. Soc. 13 (1966), 114.
- J. C. Shepherdson, Representability of recursively enumerable sets in formal theories, Arch. Math. Logik Grundlag. 5 (1960/61), 119–127. MR 126378, DOI 10.1007/BF01974157
- 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
- Stephen Cole Kleene, Introduction to metamathematics, D. Van Nostrand Co., Inc., New York, N. Y., 1952. MR 0051790
Additional Information
- © Copyright 1967 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 18 (1967), 647-651
- MSC: Primary 02.70
- DOI: https://doi.org/10.1090/S0002-9939-1967-0230617-X
- MathSciNet review: 0230617