Deduction-preserving “recursive isomorphisms” between theories
HTML articles powered by AMS MathViewer
- by Marian Boykan Pour-El and Saul Kripke PDF
- Bull. Amer. Math. Soc. 73 (1967), 145-148
References
- 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
- G. Kreisel, Mathematical significance of consistency proofs, J. Symbolic Logic 23 (1958), 155–182. MR 115912, DOI 10.2307/2964396
- John Myhill, Creative sets, Z. Math. Logik Grundlagen Math. 1 (1955), 97–108. MR 71379, DOI 10.1002/malq.19550010205
- Marian Boykan Pour-El, “Recursive isomorphism” and effectively extensible theories, Bull. Amer. Math. Soc. 71 (1965), 551–555. MR 175783, DOI 10.1090/S0002-9904-1965-11325-8 5. H. Rogers, Jr., Provable recursive functions, Bull. Amer. Math. Soc. 63 (1957), 140.
- 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
- Journal: Bull. Amer. Math. Soc. 73 (1967), 145-148
- DOI: https://doi.org/10.1090/S0002-9904-1967-11689-6
- MathSciNet review: 0215713