1. The degree of a ∑n cut;Chong;Ann. Pure Appl. Logic,1990
2. ∑n Definable sets without ∑n induction;Chong;Trans. Amer. Math. Soc.,1992
3. C.T. Chong and Y. Yang, ∑2 induction and infinite injury priority argument, part I: maximal sets and the jump operator, J. Symbolic Logic, to appear.
4. M.J. Groszek, M.E. Mytilinaios and T.A. Slaman, The Sacks density theorem and ∑2-bounding, J. Symbolic Logic, to appear.
5. M.J. Groszek and T.A. Slaman, On Turing reducibility, Preprint.