scholarly journals Natural Deduction System in Paraconsistent Setting: Proof Search for PCont

2012 ◽  
Vol 21 (1) ◽  
pp. 1-24 ◽  
Author(s):  
Alexander Bolotov ◽  
Vasilyi Shangin
Keyword(s):  
Natural Deduction ◽  
Deduction System ◽  
Proof Search ◽  
Natural Deduction System

scholarly journals Natural deduction in a paracomplete setting

2014 ◽  
Vol 20 ◽  
pp. 222-245
Author(s):  
А. Е. Болотов ◽  
В. О. Шангин
Keyword(s):  
Natural Deduction ◽  
Deduction System ◽  
Search Technique ◽  
Proof Search ◽  
Natural Deduction System ◽  
Automated Proof

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.

scholarly journals COMPLETENESS VIA CORRESPONDENCE FOR EXTENSIONS OF THE LOGIC OF PARADOX

2012 ◽  
Vol 5 (4) ◽  
pp. 720-730 ◽  
Author(s):  
BARTELD KOOI ◽  
ALLARD TAMMINGA
Keyword(s):  
Correspondence Analysis ◽  
Natural Deduction ◽  
Correspondence Theory ◽  
Truth Table ◽  
Deduction System ◽  
Natural Deduction System ◽  
Logic Of Paradox

AbstractTaking our inspiration from modal correspondence theory, we present the idea of correspondence analysis for many-valued logics. As a benchmark case, we study truth-functional extensions of the Logic of Paradox (LP). First, we characterize each of the possible truth table entries for unary and binary operators that could be added to LP by an inference scheme. Second, we define a class of natural deduction systems on the basis of these characterizing inference schemes and a natural deduction system for LP. Third, we show that each of the resulting natural deduction systems is sound and complete with respect to its particular semantics.

scholarly journals Normalization as a consequence of cut elimination

2009 ◽  
Vol 86 (100) ◽  
pp. 27-34
Author(s):  
Mirjana Borisavljevic
Keyword(s):  
Intuitionistic Logic ◽  
Natural Deduction ◽  
Cut Elimination ◽  
Deduction System ◽  
Normalization Theorem ◽  
Natural Deduction System

Pairs of systems, which consist of a system of sequents and a natural deduction system for some part of intuitionistic logic, are considered. For each of these pairs of systems the property that the normalization theorem is a consequence of the cut-elimination theorem is presented.

Sign in / Sign up

Export Citation Format

Share Document