In this paper, the paraconsistent propositional logic LG is presented, along with its semantic characterization. It is shown that LG's set of theorems corresponds to the set of valid existential graphs, GET, which turns out to be an extension of Peirce's Gamma system, without becoming Zeman's gamma-4 system. All evidence is presented in a complete, rigorous, and detailed manner. This result is generalized by constructing the paraconsistent system of existential graphs GET4, and its semantic-deductive characterization. Finally, Zeman's Gamma-4, Gamma-4.2, and Gamma-5 existential graph systems are proven to be paraconsistent.

翻译：本文提出了帕拉一致命题逻辑系统LG及其语义刻画，证明LG的定理集对应于有效存在图GET的集合，后者是皮尔斯Gamma系统的一个扩展，但并非泽曼gamma-4系统。所有论证均以完整、严格且详尽的方式呈现。通过构建帕拉一致存在图系统GET4及其语义-演绎刻画，该结果得到推广。最后，本文证明了泽曼Gamma-4、Gamma-4.2及Gamma-5存在图系统均为帕拉一致系统。