On One Approach to Goal-Driven Proof Search in Classical First-Order Logic

Abstract

An approach to a computer-oriented proof search in classical first-order logic leading to the construction of goal-driven sequent calculi that do not require skolemzation and one of which is a quantifier-rules-free one is presented. Results about the soundness and completeness of proposed sequent calculi are obtained through establishing their coextensivity with a usual Gentzen sequent calculus.