Institution of the Russian Academy of Sciences Institute of Philosophy of RAS
Abstract
In this paper we present the automated proof search
technique in natural deduction paracomplete logic. Here, for some statements we do not have evidence to conclude if they are true or false, as it happens in the classical framework. As a consequence, for example, formulae of the type p_:p, are not valid. In this
paper we formulate the natural deduction system for paracompletelogic PComp, explain its main concepts, define proof searching techniques and the searching algorithm providing examples proofs
