1. Cook S. A. and Reckhow A. R., “The relative efficiency of propositional proof systems,” J. Symbolic Logic, 44, 36–50 (1979).
2. Pudlák P., “The lengths of proofs,” in: Handbook of Proof Theory, North-Holland, Amsterdam, 1998, pp. 547–637.
3. Buss S. R., “Polynomial size proofs of the propositional pigeonhole principle,” J. Symbolic Logic, 52, 916–927 (1987).
4. Razborov A., “Lower bounds for propositional proofs and independence results in bounded arithmetic,” in: Proceedings of the 23rd ICALP, Springer-Verlag, New York; Berlin, 1996, pp. 48–62.
5. Chubaryan A. A., “On proof complexity in some system of classical propositional logic,” Izv. NAN Armenii Mat., 34, No. 5, 16–26 (1999).