1. Ajtai, M.:
$\Sigma^1_1$
formulae on finite structures. Annals of Pure. and Applied Logic 24, 1–48 (1983)
2. Cook, S., Nguyen, P.: Foundations of proof complexity: Bounded arithmetic and propositional translations, (2006), book in preparation, available online at
http://www.cs.toronto.edu/~sacook/
.
3. Håstad, J.T.: Computational limitations for small depth circuits. MIT Press, Cambridge (1987)
4. Immerman, N.: Languages that capture complexity classes. SIAM Journal on Computing 16, 760–778 (1987)
5. Kołodziejczyk, L.A., Thapen, N.: The polynomial and linear hierarchies in models where the weak pigeonhole principle fails, preprint (2006)