1. Alekhnovich, M., Razborov, A.A.: Resolution is not automatizable unless W[P] is tractable. In: FOCS, pp. 210–219. IEEE Computer Society Press, Los Alamitos (2001)
2. Lecture Notes in Computer Science;P. Fontaine,2006
3. Gordon, M.J.C., Melham, T.F.: Introduction to HOL: A theorem-proving environment for higher order logic. Cambridge University Press, Cambridge (1993)
4. Harrison, J.: Metatheory and reflection in theorem proving: A survey and critique. Technical Report CRC-053, SRI International (1995)
5. Lecture Notes in Computer Science;J. Harrison,1996