# More on Interpretations. Herbrand Theorem

In this continuation of lecture09, we discuss the foundations behind automated theorem provers for first-order logic. We describe a procedure that, given enough time, will prove any valid formula of first-order logic.