About proof-search in intuitionistic natural deduction calculus using partial Skolemization

Abstract

In this paper, automated proof search in single-conclusion sequential variant of intuitionistic and minimal predicate calculus is considered. In this algorithm, meta-variables and partial Skolemization are used. Theorems of soundness and completeness for the considered algorithm are proved. © Published under licence by IOP Publishing Ltd