Revision as of 14:28, 7 September 2017 edit 5.2.200.163 (talk) link ← Previous edit		Revision as of 01:22, 9 December 2017 edit undo JCW-CleanerBot (talk \| contribs) Bots 137,069 edits m →References: task, replaced: journal=Annals of Mathematics. Second Series → journal=Annals of Mathematics \|series=Second Series using AWB Next edit →
Line 7: * {{Citation \| last1=Myhill \| first1=John \| title=Solution of a problem of Tarski \|mr=0075894 \| year=1956 \| journal=The Journal of Symbolic Logic \| volume=21 \| pages=49–51 \| doi=10.2307/2268485 \| issue=1 \| publisher=Association for Symbolic Logic \| jstor=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 \|mr=0360235 \| year=1974 \| journal=[[Annals of Mathematics]] \|~~Annals of Mathematics.~~ series=Second Series]] \| volume=100 \| pages=80–120 \| issue=1 \| publisher=Annals of Mathematics \| jstor=1970842}} <br />

Maximal set (computability theory): Difference between revisions