Exact separation of recursively enumerable sets within theories
HTML articles powered by AMS MathViewer
- by Hilary Putnam and Raymond M. Smullyan PDF
- Proc. Amer. Math. Soc. 11 (1960), 574-577 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
- 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
- John Myhill, Creative sets, Z. Math. Logik Grundlagen Math. 1 (1955), 97–108. MR 71379, DOI 10.1002/malq.19550010205
- A. A. Mučnik, Isomorphism of systems of recursively enumerable sets with effective properties, Trudy Moskov. Mat. Obšč. 7 (1958), 407–412 (Russian). MR 0105356 R. M. Smullyan, Theory of formal systems, Doctoral Dissertation, Princeton, May 11, 1959. Also issued as a group report, #54-5, Massachusetts Institute of Technology, Lincoln Laboratory. To be published as an Annals of Mathematics Study.
- Stephen Cole Kleene, Introduction to metamathematics, D. Van Nostrand Co., Inc., New York, N. Y., 1952. MR 0051790
Additional Information
- © Copyright 1960 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 11 (1960), 574-577
- MSC: Primary 02.00
- DOI: https://doi.org/10.1090/S0002-9939-1960-0120150-1
- MathSciNet review: 0120150