1. On a problem in formal logic;Ramsey;Proc. London Math. Soc.,1930
2. Two recursively enumerable sets of incomparable degrees of un-solvability;Friedberg;Proc. Natl. Acad. Sci. U.S.,1957
3. On the unsolvability of the problem of reducibility in the theory of algorithms;Mučnik;Dokl. Akad. Nauk. SSSR (N.S.),1956
4. C.J. Jockusch, Ramsey's theorem on recursion theory (to appear).
5. C.E.M. Yates, A note on sets of indiscernibles, (these proceedings).