[1] G. C. Cejtin A. A. Čubarjan: On some bounds to the lengths of logical proofs in classical propositional calculus. (Russian), Truudy Vyčisl. Centra AN ArmSSR i Erevan. univ. 8 (1975), 57-64. MR 0469688

[2] S. A. Cook R. A. Reckhow: The relative efficiency of propositional proof systems. J. Symb. Logic 44 (1979), 36-50. MR 0523487

[3] M. Dowd: Model-theoretic aspects of $P ≠ NP$. preprint (1985).

[4] W. F. Farmer: Length of proofs and unification theory. Ph.D. thesis, Univ. of Wisconsin-Madison, 1984.

[5] J. Krajíček: On the number of steps in proofs. to appear in Annals of Pure and Applied Logic. MR 0983000

[6] J. Krajíček P. Pudlák: The number of proof lines and the size of proofs in first order logic. Archive for Mathematical Logic 27 (1988), 69-84. MR 0955313

[7] J. Krajíček P. Pudlák: Propositional proof systems, the consistency of first order theories and the complexity of computations. to appear in J. Symbolic Logic. MR 1011192

[8] R. Parikh: Some results on the length of proofs. Trans. Amer. Math. Soc. 117 (1973), 29-36. MR 0432416 | Zbl 0269.02011