Classical Logic through Refutation and Rejection
Abstract
We offer a critical overview of two sorts of proof systems that may be said to characterize classical propositional logic indirectly (and non-standardly): refutation systems, which prove sound and complete with respect to classical contradictions, and rejection systems, which prove sound and complete with respect to the larger set of all classical non-tautologies. Systems of the latter sort are especially interesting, as they show that classical propositional logic can be given a paraconsistent characterization. In both cases, we consider Hilbert-style systems as well as Gentzen-style sequent calculi and natural-deduction formalisms.