A STRUCTURAL CRITERION FOR RECURSIVE ENUMERATION WITHOUT REPETITION
1964; Wiley; Volume: 10; Issue: 8 Linguagem: Inglês
10.1002/malq.19640100802
ISSN1521-3870
AutoresMarian Boykan Pour‐El, William A. Howard,
ResumoMathematical Logic QuarterlyVolume 10, Issue 8 p. 105-114 Article A STRUCTURAL CRITERION FOR RECURSIVE ENUMERATION WITHOUT REPETITION Marian Boykan Pour-El, Marian Boykan Pour-El Princeton, New Jersey, and University Park, Pennsylvania (U.S.A.) This manuscript was completed while Marian Boykan Pour-El held a grant awarded by the Institute for Advanced Study (from funds the Institute derived from NSF-G 21514).Search for more papers by this authorWilliam A. Howard, William A. Howard Princeton, New Jersey, and University Park, Pennsylvania (U.S.A.)Search for more papers by this author Marian Boykan Pour-El, Marian Boykan Pour-El Princeton, New Jersey, and University Park, Pennsylvania (U.S.A.) This manuscript was completed while Marian Boykan Pour-El held a grant awarded by the Institute for Advanced Study (from funds the Institute derived from NSF-G 21514).Search for more papers by this authorWilliam A. Howard, William A. Howard Princeton, New Jersey, and University Park, Pennsylvania (U.S.A.)Search for more papers by this author First published: 1964 https://doi.org/10.1002/malq.19640100802Citations: 11 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 onEmailFacebookTwitterLinkedInRedditWechat References 1 R. Friedberg, Three theorems on recursive enumeration. Journal Symb. Log. 23 (1958), 309–316. 10.2307/2964290 Google Scholar 2 J. C. E. Dekker and J. Myhill, Some theorems on classes of recursively enumerable sets. Trans. Amer. Math. Soc. 89 (1958), 25–59. 10.2307/1993131 Google Scholar 3 M. B. Pour-El and H. Putnam, Recursively enumerable classes and their application to recursive sequences of formal theories, to appear. Google Scholar Citing Literature Volume10, Issue81964Pages 105-114 ReferencesRelatedInformation
Referência(s)