1. M. Ajtai.
$$\Sigma_1^1$$
-formulae on finite structures. Annals of Pure and Applied Logic, 24: 1 – 48, May 1983.
2. B. Allen. Arithmetizing uniform NC. Annals of Pure and Applied Logic, 53 (1): 1 – 50, 1991.
3. N. Alon and R. Boppana. The monotone circuit complexity of Boolean functions. Combinatorica, 7 (1): 1 – 22, 1987.
4. D. A. Barrington. A note on a theorem of Razborov. Technical report, University of Massachusetts, 1986.
5. R. B. Boppana and M. Sipser. The complexity of finite functions. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, vol. A (Algorithms and Complexity), chapter 14, pages 757–804. Elsevier Science Publishers B.V. and The MIT Press, 1990.