Процедуры вывода в секвенциальных исчислениях для конечнозначных логик с определителем равенства

Abstract

Terminated proof procedures in axiomatic extensions of sequent calculi for propositional finitely valued logics with equality determinant are proposed on the basis of logic programming.