1. W. Ackermann, Solvable Cases of the Decision Problem, North-Holland, Amsterdam, 1954.
2. Lect Notes Comput Sci;S. Berezin,1998
3. R. E. Bryant, S. German, and M. N. Velev, “Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic,” Technical report CMU-CS-99-115, Carnegie Mellon University, 1999. Available as:
http://www.cs.cmu.edu/~bryant/pubdir/cmu-cs-99-115.ps
.
4. Lect Notes Comput Sci;J. R. Burch,1994
5. W. Damm, A. Pnueli, and S. Ruah, “Herbrand automata for hardware verification,” 9th International Conference on Concurrency Theory CONCUR’ 98, Springer-Verlag, September, 1998.