English

Paraconsistency, resolution and relevance

Logic 2019-06-11 v1 Logic in Computer Science

Abstract

Digraphs provide an alternative syntax for propositional logic, with digraph kernels corresponding to classical models. Semikernels generalize kernels and we identify a subset of well-behaved semikernels that provides nontrivial models for inconsistent theories, specializing to the classical semantics for the consistent ones. Direct (instead of refutational) reasoning with classical resolution is sound and complete for this semantics, when augmented with a specific weakening which, in particular, excludes Ex Falso. Dropping all forms of weakening yields reasoning which also avoids typical fallacies of relevance.

Keywords

Cite

@article{arxiv.1906.03476,
  title  = {Paraconsistency, resolution and relevance},
  author = {Michal Walicki and Sjur Dyrkolbotn},
  journal= {arXiv preprint arXiv:1906.03476},
  year   = {2019}
}
R2 v1 2026-06-23T09:47:47.925Z