1. A Computational Logic;Boyer,1979
2. R.S. Boyer, J S. Moore, A Computational Logic Handbook, Academic Press, 1988.
3. Integrating decision procedures into heuristic theorem provers;Boyer,1988
4. E.A. Cichon, H. Touzet, An ordinal calculus for proving termination in term rewriting, in: H. Kirchner (Ed.), Proc. 21st Internat. Colloquium on Trees in Algebra and Programming, CAAP’96, Lecture Notes in Computer Science, vol. 1059, 1996, pp. 226–240.
5. C. Cornes et al., The Coq proof assistant reference manual version 5.10, Technical Report 077, INRIA, 1995.