The aim of this article is to generalize logics formal inconsistency (LFIs) systems dealing with the concept incompatibility, expressed by means a binary connective. basic idea that having two incompatible formulas hold trivializes deduction, and as special case, formula becomes consistent (in sense LFIs) when it its own negation. We show how notion extends consistency in non-trivial way, prese...