1. [1] Barwise, J., and J. Schlipf, “An introduction to recursively saturated and resplendent models,” Journal of Symbolic Logic, vol. 41 (1976), pp. 531–536.
2. [2] Enayat, A., and A. Visser, “Full satisfaction classes in a general setting, I,” in preparation.
3. [3] Engström, F., “Satisfaction classes in nonstandard models of arithmetic,” Licentiate thesis, Chalmers University of Technology (Sweden), 2002.
4. [4] Engström, F., “Expansions, omitting types, and standard systems,” Ph.D. dissertation, Chalmers University of Technology (Sweden), ProQuest LLC, Ann Arbor, 2004.
5. [5] Hinman, P. G., Recursion-Theoretic Hierarchies, Perspectives in Mathematical Logic, Springer-Verlag, Berlin, 1978.