1. M. J. Beeson. Some applications of Gentzen's proof theory in automated deduction. In P. Schroeder-Heister, editor, Extensions of Logic Programming, Lecture Notes in Computer Science 475, pages 101–156. Springer-Verlag, 1991.
2. G. L. Bellin. Herbrand's theorem for calculi of sequents LK and LJ. In D. Prawitz, editor, Proceedings of the Third Scandinavian Logic Symposium, 1980.
3. W.W. Bledsoe and P. Bruell. A man-machine theorem-proving system. In Advance Papers of Third International Joint Conference on Artificial Intelligence. W.W. Bledsoe, 1974.
4. K. A. Bowen. Programming with full Jirst-order logic. In J. E. Hayes, D. Michie, and Y.-H. Pao, editors, Machine Intelligence 10, pages 421–440. Halsted Press, 1982.
5. R. L. Constable, et al., Implementing Mathematics with the Nuprl. Prentice-Hall, New Jersey, 1986.