Saved in:
Bibliographic Details
Main Author: Ramírez, Oscar
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2411.01627
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866908588107104256
author Ramírez, Oscar
author_facet Ramírez, Oscar
contents One advantage of paraconsistent logic is that it can deal with inconsistencies without making the system trivial. However, unlike classical propositional calculus, its deductive system is limited, and the meaning of paraconsistent negation is still not clear. This article presents a logical system that brings together the strengths of both approaches. The Propositional Calculus with Multiple Negations $\left(\textbf{CPN}_{n}\right)$ is a generalization of classical propositional logic in which a finite number of negations (each weaker than the classical one but with similar behavior) are added. This makes it possible to introduce weak inconsistencies in a controlled way without leading to triviality.
format Preprint
id arxiv_https___arxiv_org_abs_2411_01627
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Propositional Calculus with Multiple Negations
Ramírez, Oscar
Logic
One advantage of paraconsistent logic is that it can deal with inconsistencies without making the system trivial. However, unlike classical propositional calculus, its deductive system is limited, and the meaning of paraconsistent negation is still not clear. This article presents a logical system that brings together the strengths of both approaches. The Propositional Calculus with Multiple Negations $\left(\textbf{CPN}_{n}\right)$ is a generalization of classical propositional logic in which a finite number of negations (each weaker than the classical one but with similar behavior) are added. This makes it possible to introduce weak inconsistencies in a controlled way without leading to triviality.
title Propositional Calculus with Multiple Negations
topic Logic
url https://arxiv.org/abs/2411.01627