... 3427.5.4 Herbrand’s Theorem for Prenex Formulae, 344 Logic For Computer Science Foundations of Automatic Theorem Proving Copyright 2003, Jean H. GallierJune 2003xx TABLE OF CONTENTSPROBLEMS, ... provable formula is true.We will also define rigorously the notion of proof, and proof system for first-order logic (and many-sorted first-order logic) . The branch of logic concerned with the study of ... result, the goal of automatic theorem proving (for short, atp) is to find efficient algorithmicmethods for finding proofs of those formulae that are true.A fairly intuitive method for finding such...