Abstract
Paraconsistent logical systems are well-known reasoning frameworks aimed to infer new facts or properties under contradictory assumptions. Applications of these systems are well known in wide range of computer science domains. In this article, we study the paraconsistent logic CG ′ 3 , which can be viewed as an extension of the logic G ′ 3 . CG ′ 3 is also 3 -valued, but with two designated values. Main results can be summarized as follows: a Hilbert-type axiomatization, based on Kalmár’s approach; and a new notion of validity, based on also novel Kripke semantics.
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.
