PL EN


Preferences help
enabled [disable] Abstract
Number of results
2014 | 49 |
Article title

AN EIGHT-VALUED PRACONSISTENT LOGIC

Authors
Content
Title variants
Languages of publication
PL
Abstracts
PL
It is known that many-valued paraconsistent logics are useful for expressing uncertain and inconsistency-tolerant reasoning in a wide range of Computer Science. Some four-valued and sixteen-valued logics have especially been well-studied. Some four-valued logics are not so ne-grained, and some sixteen-valued logics are enough ne-grained, but rather complex. In this paper, a natural eight-valued paraconsistent logic rather than four-valued and sixteen-valued logics is introduced as a Gentzen-type sequent calculus. This eight-valued logic is enough ne-grained and simpler than sixteen-valued logic. A triplet valuation semantics is introduced for this logic, and the completeness theorem for this semantics is proved. The cut-elimination theorem for this logic is proved, and this logic is shown to be decidable.
Keywords
PL
 
Publisher
Year
Volume
49
Physical description
Dates
published
2014
online
07 - 07 - 2015
Contributors
References
Document Type
Publication order reference
Identifiers
YADDA identifier
bwmeta1.element.ojs-issn-2084-2589-year-2014-volume-49-article-2915
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.