On one generalization of the principle reductio ad absurdum

On the base of comparing of the Curry logic of classical refutability and the Łukasiewicz modal logic we suggest a generalization of the notion of negation as reducibility to a unary absurdity operator, $\lnot \varphi:=\varphi\supset A(\varphi)$. We study the possibility to represent in this form the negation in such well known systems of paraconsistent logic as the logic of Batens $\mathbf{CLuN}$ and the maximal paraconsistent logic of Sette $P^1$.