Saved in:
Bibliographic Details
Main Author: Sierra-Aristizabal, Manuel
Format: Preprint
Published: 2023
Subjects:
Online Access:https://arxiv.org/abs/2312.04367
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866910287009939456
author Sierra-Aristizabal, Manuel
author_facet Sierra-Aristizabal, Manuel
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2312_04367
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Paraconsistent Existential Graphs Gamma Peirce System
Sierra-Aristizabal, Manuel
Logic
Logic in Computer Science
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.
title Paraconsistent Existential Graphs Gamma Peirce System
topic Logic
Logic in Computer Science
url https://arxiv.org/abs/2312.04367