Paraconsistency, resolution and relevance

06/08/2019
by   Michal Walicki, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/13/2022

Logic of Combinatory Logic

We develop a classical propositional logic for reasoning about combinato...
research
07/14/2023

Orthologic with Axioms

We study the proof theory and algorithms for orthologic, a logical syste...
research
11/12/2020

Functorial Semantics for Partial Theories

We provide a Lawvere-style definition for partial theories, extending th...
research
07/15/2022

Semantic Incompleteness of Hilbert System for a Combination of Classical and Intuitionistic Propositional Logic

This paper shows Hilbert system (𝐂+𝐉)^-, given by del Cerro and Herzig (...
research
09/12/2020

Finite Horn Monoids via Propositional Horn Theory Composition

Describing complex objects as the composition of elementary ones is a co...
research
08/01/2023

Proceedings Modalities in substructural logics: Applications at the interfaces of logic, language and computation

By calling into question the implicit structural rules that are taken fo...
research
03/08/2000

Relevance Sensitive Non-Monotonic Inference on Belief Sequences

We present a method for relevance sensitive non-monotonic inference from...

Please sign up or login with your details

Forgot password? Click here to reset