Using non-deterministic structures called Nmatrices, we provide simple modular non-deterministic semantics for a large family of first-order paraconsistent logics with a formal consistency operator, also known as LFIs. This includes da-Costa's well known predicate calculus C_(1). We show how consistency propagation in quantified formulas is captured in the semantic framework of Nmatrices, and analyze the semantic effects of different styles of propagation considered in the literature of LFIs. Then we demonstrate how the tool of Nmatrices can be applied to prove a non-trivial property of firstorder LFIs discussed in this paper.
展开▼
