On the Algebrization of the Multi-valued Logics CG′3 and G′3



Document title: On the Algebrization of the Multi-valued Logics CG′3 and G′3
Journal: Computación y sistemas
Database:
System number: 000560617
ISSN: 1405-5546
Authors: 1
1
Institutions: 1Universidad Nacional Autónoma de México, Facultad de Ingeniería, México
Year:
Season: Oct-Dic
Volumen: 25
Number: 4
Pages: 751-759
Country: México
Language: Inglés
English abstract Multi-valued logics form a family of formal languages with several applications in computer sciences, particularly in the field of Artificial intelligence. Paraconsistent multi-valued logics have been successful applied in logic programming, fuzzy reasoning, and even in the construction of paraconsistent neural networks. G ′ 3 is a 3-valued logic with a single represented truth value by 1. C G ′ 3 is a paraconsistent, 3-valued logic that extends G ′ 3 with two truth values represented by 1 and 2. The state of the art of C G ′ 3 comprises a Kripke semantics and a Hilbert axiomatization inspired by the Lindenbaum-Łos technique. In this work, we show that G ′ 3 and C G ′ 3 are algebrizable in the sense of Blok and Pigozzi. These results may apply to the development of paraconsistent reasoning systems.
Keyword: Paraconsistent logics,
Blok-pigozzi algebrization,
Non-monotonic reasoning
Full text: Texto completo (Ver HTML) Texto completo (Ver PDF)