Uniform non deterministic logic semantics extend paraconsistent hierarchy

Uniform Non-Deterministic Semantics for Ciuciura's $mbC^n$-Hierarchy

Logic in Computer Science

Summary

Some logical systems can handle contradictions without breaking down, called paraconsistent logics. This paper deals with a family of such systems called mbC^n, created by Ciuciura, and introduces a new way to understand them using a type of logic that can give multiple possible truth values at once (non-deterministic semantics). The authors also show that their method fully matches the formal rules of these systems and prove that simpler, finite methods cannot capture their behavior.

What this means in practice

  • For logic system designers: Determine that finite deterministic matrices cannot fully capture consequence relations in mbC^n systems under this semantic framework.
  • For automated reasoning developers: Implement uniform non-deterministic semantics to handle contradictions robustly across the mbC^n hierarchy in reasoning engines.

A theory result. No direct application yet.

Authors

Ela Drozdowska, Pawel Pawlowski

Abstract

We introduce a uniform non-deterministic semantics for the hierarchy of paraconsistent systems mbC^n introduced by Ciuciura. The proposed construction generalizes Omori's three-valued semantics for mbC^1 to all systems of the hierarchy. We prove soundness and completeness of the semantics with respect to the corresponding axiomatizations and show that the consequence relations of the systems mbC^n cannot be characterized by finite deterministic matrices.