Author:
Kołodziejczyk Leszek A.,Thapen Neil
Reference9 articles.
1. Σ11 formulae on finite structures;Ajtai;Annals Pure Appl. Logic,1983
2. S. Cook, and P. Nguyen, Foundations of Proof Complexity: Bounded Arithmetic and Propositional Translations. Book in preparation, available online at http://www.cs.toronto.edu/∼sacook/.
3. J. T. Håstad, Computational Limitations for Small Depth Circuits (MIT Press, 1987).
4. Languages that capture complexity classes;Immerman;SIAM J. Computing,1987
5. L. A. Kołodziejczyk, and N. Thapen, The polynomial and linear hierarchies in V0. In: Computation and Logic in the Real World, Third Conference on Computability in Europe, 2007 (S. B. Cooper, B. Löwe, and A. Sorbi, eds.). Lecture Notes in Computer Science 4497, pp. 408-415 (Springer, 2007).