Abstract
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 paraconsistent logics have especially been well-studied. Some four-valued logics are not so fine-grained, and some sixteen-valued logics are enough fine-grained, but rather complex. In this paper, a natural eight-valued paraconsistent logic in between four-valued and sixteen-valued logics is introduced as a Gentzen-type sequent calculus. 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
