Metraipolis › archive › dc_e2a3d36ccc6a

Paraclassical Logics with Two Negations — arXiv:2610.40814

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.40814
License (as archived)
CC0-1.0
Archived
2026-11-03T05:50:28.892Z
SHA-256 of the archived text
b31a6c6fb7ac5189982df42634304f3c4010825dd87b7d812ee9191beb44baca
Stable URL of this page
https://metraipolis.com/documento/dc_e2a3d36ccc6a

How to cite

Paraclassical Logics with Two Negations — arXiv:2610.40814 — arXiv (en), https://arxiv.org/abs/2610.40814 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e2a3d36ccc6a (Metraipolis archive dc_e2a3d36ccc6a, sha256 b31a6c6fb7ac5189982df42634304f3c4010825dd87b7d812ee9191beb44baca)
BibTeX
@misc{dce2a3d36ccc6a,
  title = {Paraclassical Logics with Two Negations — arXiv:2610.40814},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.40814},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e2a3d36ccc6a; sha256 b31a6c6fb7ac5189982df42634304f3c4010825dd87b7d812ee9191beb44baca},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.40814. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We study three paraclassical propositional logics with two negations, CLoaN, CLouN, and CLauN, obtained by pairwise combining the one-negation systems CLuN, CLaN, and CLoN. CLuN's negation is glut-tolerant and paraconsistent, CLaN's negationis gap-tolerant and paracomplete, and CLoN's negation is both paraconsistent and paracomplete. We provide sound and complete two-valued non-deterministic semantics for each of the two-negations systems. We then focus on CLauN, the system containing the primitive dual pair of CLaN and CLuN negations. In this setting, we show deductive relationships between different negations expressible in CLauN; we show two diferent ways to recapture classical logic by means of translations, locally and globally; and we show a duality results for the multiple conclusion consequence relation of the logic.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.LO, nuovi lavori del giorno).
Categorie arXiv: Logic in Computer Science (cs.LO).
Pagina del lavoro: https://arxiv.org/abs/2610.40814 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T05:35:02.107Z dalla pagina https://arxiv.org/list/cs.LO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).