Preprint
Aug 2026
Self-extensional logics of formal inconsistency: Decidability and limits for paraconsistency
A coNEXPTIME upper bound for the validity problem of RmbC and a coNP-hardness lower bound are established, and coNP-completeness for the principal extensions containing one of the six minimal explosive pairs are proved.
M. Coniglio, Héctor Federico Mallea
· 0 citations