==References located in collections== 
 Apart from the usefulness of alphabetization, it seems strange to include a paper as a separate entity that can be found in a collection. In this instanceThe Undecidable is the collection. If the refs were to list the papers under the collection, then they would look like the following: 
 * Burgin, M. and Klinger, A. "Experience, Generations, and Limits in Machine Learning." Theoretical Computer Science v. 317, No. 1/3, 2004, pp. 71–91 
 * M. Davis, ed., 1965.  The Undecidable—Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions, Raven, New York. Reprint, Dover, 2004. ISBN 0-486-43228-9 
 :* A. Church, 1936a. "An unsolvable problem of elementary number theory." American Journal of Mathematics v. 58, pp. 345–363.  Reprinted in "The Undecidable", M. Davis ed., 1965.  
 :* A. Church, 1936b. "A note on the Entscheidungsproblem." Journal of Symbolic Logic v. 1, n. 1, and v. 3, n. 3. Reprinted in "The Undecidable", M. Davis ed., 1965.  
 :*E. Post, 1944, "Recursively enumerable sets of positive integers and their decision problems", Bulletin of the American Mathematical Society, volume 50, pages 284–316. 
 :*E. Post, 1947. "Recursive unsolvability of a problem of Thue." Journal of Symbolic Logic  v. 12, pp. 1–11. Reprinted in "The Undecidable", M. Davis ed., 1965. 
 :* A. Turing, 1937. "On computable numbers, with an application to the Entscheidungsproblem." Proceedings of the London Mathematics Society, ser. 2 v. 42, pp. 230–265.  Corrections ibid. v. 43 (1937) pp. 544–546.  Reprinted in "The Undecidable", M. Davis ed., 1965. PDF from comlab.ox.ac.uk  
 :* A. Turing, 1939. "Systems of logic based on ordinals." Proceedings of the London Mathematics Society, ser. 2 v. 45, pp. 161–228. Reprinted in "The Undecidable", M. Davis ed., 1965. 
 * R. M. Friedberg, 1958. "Three theorems on recursive enumeration: I. Decomposition, II. Maximal Set, III. Enumeration without repetition." The Journal of Symbolic Logic, v. 23, pp. 309–316. 
 * E. M. Gold, 1967. "Language identification in the limit". Information and Control, volume 10, pages 447–474. 
 *L. Harrington and R. I. Soare, 1991. "Post's Program and incomplete recursively enumerable sets", Proceedings of the National Academy of Sciences of the USA, volume 88, pages 10242—10246. 
 * C. Jockusch jr, "Semirecursive sets and positive reducibility", Trans. Amer. Math. Soc. 137 (1968) 420-436 
 * S. C. Kleene and E. L. Post, 1954. "The upper semi-lattice of degrees of recursive unsolvability." Annals of Mathematics v. 2 n. 59, 379–407. 
 *J. Myhill, 1956. "The lattice of recursively enumerable sets." The Journal of Symbolic Logic, v. 21, pp. 215–220. 
 *  
 *T. Slaman and W. H. Woodin, 1986. "Definability in the Turing degrees." Illinois J. Math. v. 30 n. 2, pp. 320–334.  
 * R. I. Soare, 1974. "Automorphisms of the lattice of recursively enumerable sets, Part I: Maximal sets." Annals of Mathematics, v. 100, pp. 80–120. 

 To make this good, I'd have to go through the various papers and find out where they're located in The Undecidable (not a problem). (My apologies to all if this has been argued over already with a consensus to just list alphabetically). Bill