1. Chang C.C. and Keisler H.J., Model Theory (North-Holland, Amsterdam, second edition 1977)
2. Cook S.A., The complexity of theorem proving procedures, In: Proceedings of the Third Annual ACM Symp. on the Theory of Computing, May 1971, pp.151–158
3. The relative efficiency of proposi-tional proof systems;Cook;Journal of Symb.Logic,1979
4. The complexity of explicit definitions;Friedman;Advances in Mathematics,1976
5. Machtey M. and Young P., An Introduction to the General Theory of Algorithms (North-Holland, Amsterdam, third printing 1979)