Name
Abstract | ||
|---|---|---|
A strong negation in da Costa's Cn systems can be naturally extended from the strong negation (¿) of C1. In Newton C. A. da Costa. On the theory of inconsistent formal systems. Notre Dame Journal of Formal Logic, 15(4):497-510, 10 1974 Newton da Costa proved the connectives {¿,¿,¿,¿} in C1 satisfy all schemas and inference rules of classical logic. In the following paper we present a proof that all logics in the Cn herarchy also behave classically as C1. This result tell us the existance of a common property among the paraconsistent family of logics created by da Costa. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.entcs.2015.06.002 | Electronic Notes in Theoretical Computer Science |
Keywords | Field | DocType |
paraconsistent logic | Formal system,Discrete mathematics,Common property,Paraconsistent logic,Negation,Computer science,Classical logic,Schema (psychology),Rule of inference | Conference |
Volume | ISSN | Citations |
315 | 1571-0661 | 0 |
PageRank | References | Authors |
0.34 | 2 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mauricio Osorio | 1 | 436 | 52.82 |
| Jose Abel Castellanos Joo | 2 | 0 | 0.34 |