Baumgartner, J., Iterated forcing, Surveys in set theory (Mathias, A. R. D., editor), London Mathematical Society Lecture Note Series, no. 87, Cambridge University Press, Cambridge, 1983, pp. 1–59.
Beller, A., Jensen, R., and Welch, P., Coding the universe, London Mathematical Society Lecture Note Series, no. 47, Cambridge University Press, Cambridge, 1982.
Carlson, T., Kunen, K., and Miller, A., A minimal degree which collapses ω1
, this Journal, vol. 49 (1984), pp. 298–300.
The coding method in set theory
(book, in preparation).
Gray, C., Iterated forcing from the strategic point of view, Ph.D. Thesis, University of California, Berkeley, California, 1980.
Grigorieff, S., Combinatorics on ideals and forcing, Annals of Mathematical Logic, vol. 3 (1971), pp. 363–394.
Jensen, R., Definable sets of minimal degree, Mathematical logic and foundations of set theory (Bar-Hillel, Y., editor), North-Holland, Amsterdam, 1970, pp. 122–128.
Jensen, R. and Solovay, R., Some applications of almost disjoint sets, Mathematical logic and foundations of set theory (Bar-Hillel, Y., editor), North-Holland, Amsterdam, 1970, pp. 84–104.
Laver, R., On the consistency of Borel's conjecture, Acta Mathematica, vol. 137 (1976), pp. 151–169.
Miller, A., Rational perfect set forcing, Axiomatic set theory (Baumgartner, J.
et al., editors), Contemporary Mathematics, vol. 31, American Mathematical Society, Providence, Rhode Island, 1984, pp. 143–159.
Sacks, G., Countable admissible ordinals and hyperdegrees, Advances in Mathematics, vol. 19 (1976), pp. 213–262.10.1016/0001-8708(76)90187-0
Sacks, G., Forcing with perfect closed sets, Axiomatic set theory (Scott, D., editor), Proceedings of Symposia in Pure Mathematics, vol. 13, part 1, American Mathematical Society, Providence, Rhode Island, 1971, pp. 331–355.10.1090/pspum/013.1/0276079