Natural deduction in a paracomplete setting

Main Article Content

А. Е. Болотов
В. О. Шангин


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 paracomplete logic PComp, explain its main concepts, define proof searching techniques and the searching algorithm providing examples proofs.


Данные скачивания пока не доступны.

Article Details

Как цитировать
А. Е. Болотов и В. О. Шангин. Natural deduction in a paracomplete setting // Логические исследования / Logical Investigations. 2018. Т. 20. № 1.