On Hoare logic and Kleene algebra with tests

We show that Kleene algebra with tests subsumes propositional Hoare logic. Thus the specialized syntax and deductive apparatus of Hoare logic are inessential and can be replaced by simple equational reasoning. We show using this reduction that propositional Hoare logic is PSPACE-complete.