Solovay, Robert M. (2000). A version of Ω for which ZFC cannot predict a single bit. In Finite versus infinite Discrete Math. Theor. Comput. Sci. (Lond.) 323-334 Springer London. [MR] [GS?]
Gasarch, William I. and Pleszkoch, Mark G. and Solovay, Robert (1992). Learning via queries in [+,<]. J. Symbolic Logic 57 No.1, 53-81. [MR] [GS?]
Solovay, Robert M. (1989). Injecting inconsistencies into models of PA. Ann. Pure Appl. Logic 44 No.1-2, 101-132. Third Asian Conference on Mathematical Logic (Beijing, 1987). [MR] [GS?]
Jockusch, Jr., C. G. and Lerman, M. and Soare, R. I. and Solovay, R. M. (1989). Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion. J. Symbolic Logic 54 No.4, 1288-1323. [MR] [GS?]
Abraham, U. and Shelah, S. and Solovay, R. M. (1987). Squares with diamonds and Souslin trees with special squares. Fund. Math. 127 No.2, 133-162. [MR] [GS?]
