Undecidability and recursive inseparability
1958; Wiley; Volume: 4; Issue: 7-11 Linguagem: Inglês
10.1002/malq.19580040705
ISSN1521-3870
Autores Tópico(s)Computability, Logic, AI Algorithms
ResumoMathematical Logic QuarterlyVolume 4, Issue 7-11 p. 143-147 Article Undecidability and recursive inseparability† Raymond M. Smullyan, Raymond M. Smullyan PrincetonSearch for more papers by this author Raymond M. Smullyan, Raymond M. Smullyan PrincetonSearch for more papers by this author First published: 1958 https://doi.org/10.1002/malq.19580040705Citations: 9 † The author wishes to express his thanks to Simon Kochen of Princeton University, for reading this manuscript and suggesting several improvements. AboutPDF ToolsRequest permissionExport citationAdd to favoritesTrack citation ShareShare Give accessShare full text accessShare full-text accessPlease review our Terms and Conditions of Use and check box below to share full-text version of article.I have read and accept the Wiley Online Library Terms and Conditions of UseShareable LinkUse the link below to share a full-text version of this article with your friends and colleagues. Learn more.Copy URL Share a linkShare onFacebookTwitterLinked InRedditWechat Citing Literature Volume4, Issue7-111958Pages 143-147 RelatedInformation
Referência(s)