Revision as of 04:57, 13 July 2008 edit SmackBot (talk \| contribs) 3,734,324 edits m Date the maintenance tags or general fixes ← Previous edit		Revision as of 03:18, 16 July 2008 edit undo JackSchmidt (talk \| contribs) Extended confirmed users, Rollbackers 6,625 edits →References: two references from mathscinet Next edit →
Line 6: ==References== {{Citation \| last1=Friedberg \| first1=Richard M. \| title=Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication \| id={{MathSciNet \| id = 0109125}} \| year=1958 \| journal=The Journal of Symbolic Logic \| issn=0022-4812 \| volume=23 \| pages=309–316}} {{Citation \| last1=Myhill \| first1=John \| title=Solution of a problem of Tarski \| id={{MathSciNet \| id = 0075894}} \| year=1956 \| journal=The Journal of Symbolic Logic \| issn=0022-4812 \| volume=21 \| pages=49–51}} * H. Rogers, Jr., 1967. ''The Theory of Recursive Functions and Effective Computability'', second edition 1987, MIT Press. ISBN 0-262-68052-1 (paperback), ISBN 0-07-053522-1.

Maximal set (computability theory): Difference between revisions