The present paper expounds a preferred models semantics of paraconsistent reasoning. The basic idea of this semantics is that we interpret the language L(V) of a theory T in such a way that the axioms of T are satisfied to a maximal extent. These preferred interpretations are described in terms of a network of partial structures. Upon this semantic analysis of paraconsistent reasoning we develop a corresponding proof theory using adaptive logics.
Andreas, H. , Verdée, P. (2016)., Adaptive proofs for networks of partial structures, in H. Andreas & P. Verdée (eds.), Logical studies of paraconsistent reasoning in science and mathematics, Dordrecht, Springer, pp. 17-45.
This document is unfortunately not available for download at the moment.