Revision as of 23:18, 5 February 2009 edit SmackBot (talk \| contribs) 3,734,324 edits m Date maintenance tags and general fixes ← Previous edit		Revision as of 03:06, 13 April 2009 edit undo Citation bot (talk \| contribs) Bots 5,867,796 edits m Citation maintenance. Added: doi. You can use this bot yourself! Please report any bugs. 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 \| doi=10.2307/2964290}} * {{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 \| doi=10.2307/2268485}} * 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. * {{Citation \| last1=Soare \| first1=Robert I. \| title=Automorphisms of the lattice of recursively enumerable sets. I. Maximal sets \| doi=10.2307/1970842 \| id={{MathSciNet \| id = 0360235}} \| year=1974 \| journal=[[Annals of Mathematics\|Annals of Mathematics. Second Series]] ~~\| issn=0003-486X~~ \| volume=100 \| pages=80–120}} <br />

Maximal set (computability theory): Difference between revisions