Some definitions of negation leading to paraconsistent logics (Q1062973)

In positive logic the negation of a proposition A is defined by \(A\supset X\) where X is some fixed proposition. A number of standard properties of negation, including reductio ad absurdum, can then be proved, but not the law of noncontradiction so that this forms a paraconsistent logic. Various stronger paraconsistent logics are then generated by putting in particular propositions for X. These propositions range from true through contingent to false.