<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>1405-5546</journal-id>
<journal-title><![CDATA[Computación y Sistemas]]></journal-title>
<abbrev-journal-title><![CDATA[Comp. y Sist.]]></abbrev-journal-title>
<issn>1405-5546</issn>
<publisher>
<publisher-name><![CDATA[Instituto Politécnico Nacional, Centro de Investigación en Computación]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1405-55462021000400751</article-id>
<article-id pub-id-type="doi">10.13053/cys-25-4-4046</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[On the Algebrization of the Multi-valued Logics CG&#8242;3 and G&#8242;3]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Pérez-Gaspar]]></surname>
<given-names><![CDATA[Miguel]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Bárcenas]]></surname>
<given-names><![CDATA[Everardo]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad Nacional Autónoma de México Facultad de Ingeniería ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>12</month>
<year>2021</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>12</month>
<year>2021</year>
</pub-date>
<volume>25</volume>
<numero>4</numero>
<fpage>751</fpage>
<lpage>759</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462021000400751&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S1405-55462021000400751&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S1405-55462021000400751&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[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 &#8242; 3 is a 3-valued logic with a single represented truth value by 1.    C    G &#8242; 3 is a paraconsistent, 3-valued logic that extends      G &#8242; 3 with two truth values represented by 1 and 2. The state of the art of    C    G &#8242; 3 comprises a Kripke semantics and a Hilbert axiomatization inspired by the Lindenbaum-&#321;os technique. In this work, we show that      G &#8242; 3 and    C    G &#8242; 3 are algebrizable in the sense of Blok and Pigozzi. These results may apply to the development of paraconsistent reasoning systems.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Paraconsistent logics]]></kwd>
<kwd lng="en"><![CDATA[blok-pigozzi algebrization]]></kwd>
<kwd lng="en"><![CDATA[non-monotonic reasoning]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<label>1</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Abe]]></surname>
<given-names><![CDATA[J. M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Fundamentos da lógica anotada. Foundations of Annotated Logics]]></source>
<year>1992</year>
<publisher-loc><![CDATA[São Paulo ]]></publisher-loc>
<publisher-name><![CDATA[University of São Paulo]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B2">
<label>2</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Abe]]></surname>
<given-names><![CDATA[J. M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Paraconsistent intelligent-based systems: New trends in the applications of paraconsistency]]></source>
<year>2015</year>
<volume>94</volume>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B3">
<label>3</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Abe]]></surname>
<given-names><![CDATA[J. M.]]></given-names>
</name>
<name>
<surname><![CDATA[Akama]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Nakamatsu]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<source><![CDATA[Introduction to annotated logics: foundations for paracomplete and paraconsistent reasoning]]></source>
<year>2015</year>
<volume>88</volume>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B4">
<label>4</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Abe]]></surname>
<given-names><![CDATA[J. M.]]></given-names>
</name>
<name>
<surname><![CDATA[Nakamatsu]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[da Silva Filho]]></surname>
<given-names><![CDATA[J. I.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Three decades of paraconsistent annotated logics: a review paper on some applications]]></article-title>
<source><![CDATA[Procedia Computer Science]]></source>
<year>2019</year>
<volume>159</volume>
<page-range>1175-81</page-range></nlm-citation>
</ref>
<ref id="B5">
<label>5</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Blass]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[2003 annual meeting of the association for symbolic logic]]></article-title>
<source><![CDATA[Bulletin of Symbolic Logic]]></source>
<year>2004</year>
<volume>10</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>120-45</page-range></nlm-citation>
</ref>
<ref id="B6">
<label>6</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Blok]]></surname>
<given-names><![CDATA[W. J.]]></given-names>
</name>
<name>
<surname><![CDATA[Pigozzi]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[Algebraizable logics]]></source>
<year>1989</year>
<volume>77</volume>
<publisher-name><![CDATA[American Mathematical Soc]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B7">
<label>7</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Boole]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[The Mathematical Analysis of Logic]]></source>
<year>1847</year>
<publisher-name><![CDATA[Springer-Sciencie]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B8">
<label>8</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Burris]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Legris]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The algebra of logic tradition]]></article-title>
<source><![CDATA[Stanford Encyclopedia of Philosophy]]></source>
<year>2009</year>
</nlm-citation>
</ref>
<ref id="B9">
<label>9</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Carnielli]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Coniglio]]></surname>
<given-names><![CDATA[M. E.]]></given-names>
</name>
</person-group>
<source><![CDATA[Paraconsistent logic: Consistency, contradiction and negation]]></source>
<year>2016</year>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B10">
<label>10</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cîrstea]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Kurz]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Pattinson]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Schröder]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Venema]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Modal logics are coalgebraic]]></article-title>
<source><![CDATA[Comput. J.]]></source>
<year>2011</year>
<volume>54</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>31-41</page-range></nlm-citation>
</ref>
<ref id="B11">
<label>11</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Curry]]></surname>
<given-names><![CDATA[H. B.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Functionality in combinatory logic]]></article-title>
<source><![CDATA[Proceedings of the National Academy of Sciences of the United States of America]]></source>
<year>1934</year>
<volume>20</volume>
<numero>11</numero>
<issue>11</issue>
<page-range>584</page-range></nlm-citation>
</ref>
<ref id="B12">
<label>12</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Czelakowski]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Protoalgebraic logics]]></article-title>
<source><![CDATA[Protoalgebraic Logics]]></source>
<year>2001</year>
<page-range>69-122</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B13">
<label>13</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Font]]></surname>
<given-names><![CDATA[J. M.]]></given-names>
</name>
<name>
<surname><![CDATA[Jansana]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[A general algebraic semantics for sentential logics]]></source>
<year>2017</year>
<volume>7</volume>
<publisher-name><![CDATA[Cambridge University Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B14">
<label>14</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Font]]></surname>
<given-names><![CDATA[J. M.]]></given-names>
</name>
<name>
<surname><![CDATA[Jansana]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Pigozzi]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A survey of abstract algebraic logic]]></article-title>
<source><![CDATA[Studia Logica]]></source>
<year>2003</year>
<volume>74</volume>
<numero>1-2</numero>
<issue>1-2</issue>
<page-range>13-97</page-range></nlm-citation>
</ref>
<ref id="B15">
<label>15</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gottwald]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Many-valued logic]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Zalta]]></surname>
<given-names><![CDATA[E. N.]]></given-names>
</name>
</person-group>
<source><![CDATA[The Stanford Encyclopedia of Philosophy]]></source>
<year>2017</year>
<edition>2017</edition>
<publisher-name><![CDATA[Metaphysics Research Lab, Stanford University]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B16">
<label>16</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Graham]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Koji]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Zach]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Paraconsistent logic]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Zalta]]></surname>
<given-names><![CDATA[E. N.]]></given-names>
</name>
</person-group>
<source><![CDATA[The Stanford Encyclopedia of Philosophy]]></source>
<year>2018</year>
<edition>2018</edition>
<publisher-name><![CDATA[Metaphysics Research Lab, Stanford University]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B17">
<label>17</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kupke]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Pattinson]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Schröder]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Reasoning with global assumptions in arithmetic modal logics]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Kosowski]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Walukiewicz]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
</person-group>
<source><![CDATA[Fundamentals of Computation Theory -20th International Symposium, FCT, Proceedings, volume 9210 of Lecture Notes in Computer Science]]></source>
<year>2015</year>
<page-range>367-80</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B18">
<label>18</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Limón]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Bárcenas]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Benítez-Guerrero]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Molero]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[On the consistency of context-aware systems]]></article-title>
<source><![CDATA[Journal of Intelligent &amp; Fuzzy Systems]]></source>
<year>2018</year>
<volume>34</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>3373-83</page-range></nlm-citation>
</ref>
<ref id="B19">
<label>19</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Malinowski]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<source><![CDATA[Many-Valued Logics]]></source>
<year>1993</year>
<publisher-name><![CDATA[Oxford University Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B20">
<label>20</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Metcalfe]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Olivetti]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Gabbay]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[Proof theory for fuzzy logics (Applied Logic Series)]]></source>
<year>2009</year>
<volume>36</volume>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B21">
<label>21</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Osorio]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Carballido]]></surname>
<given-names><![CDATA[J. L.]]></given-names>
</name>
<name>
<surname><![CDATA[Zepeda]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Revisiting Z]]></article-title>
<source><![CDATA[Notre Dame Journal of Formal Logic]]></source>
<year>2014</year>
<volume>55</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>129-55</page-range></nlm-citation>
</ref>
<ref id="B22">
<label>22</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Osorio Galindo]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Carballido Carranza]]></surname>
<given-names><![CDATA[J. L.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Brief study of G&#8242;3 logic]]></article-title>
<source><![CDATA[Journal of Applied Non-Classical Logics]]></source>
<year>2008</year>
<volume>18</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>475-99</page-range></nlm-citation>
</ref>
<ref id="B23">
<label>23</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pérez-Gaspar]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Bárcenas]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<source><![CDATA[Completeness for the paraconsistent logic CG&#8242;3 based on maximal theories]]></source>
<year>2019</year>
<numero>1659</numero>
<issue>1659</issue>
<publisher-name><![CDATA[CEUR Workshop Proceedings]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B24">
<label>24</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Subrahmanian]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
</person-group>
<source><![CDATA[On the semantics of quantitative logic programs]]></source>
<year>1987</year>
<page-range>173-82</page-range><publisher-name><![CDATA[SLP]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B25">
<label>25</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Thomason]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Logic and artificial intelligence]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Zalta]]></surname>
<given-names><![CDATA[E. N.]]></given-names>
</name>
</person-group>
<source><![CDATA[The Stanford Encyclopedia of Philosophy]]></source>
<year>2020</year>
<edition>2020</edition>
<publisher-name><![CDATA[Metaphysics Research Lab, Stanford University]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B26">
<label>26</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zamansky]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[On recent applications of paraconsistent logic: an exploratory literature review]]></article-title>
<source><![CDATA[Journal of Applied Non-Classical Logics]]></source>
<year>2019</year>
<volume>29</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>382-91</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
