Vyacheslav Bocharov

Learn More
We present a proof-searching algorithm for the classical first order natural deduction calculus and prove its correctness. For any given task (if this task is indeed solvable), a searching algorithm terminates, either finding a corresponding natural deduction proof or giving a set of constraints, from which a counterexample can be extracted. Proofs of the(More)
  • 1