Propositions in Prepositional Logic Provable Only by Indirect Proofs
Jan B. Ekman · Mathematical logic quarterly · 1998
Abstract In this paper it is shown that addition of certain reductions to the standard cut removing reductions of deductions in prepositional logic makes prepositional logic non‐normalizable. From this follows that some provable propositions in prepositional logic has no direct proof.