In this paper we study symmetric inference systems (that is, pairs of inference systems)
as refutation systems characterizing maximal logics with certain properties. In particular,
the method is applied to paraconsistent logics, which are natural examples of such logics.