Kozen, DexterTiuryn, Jerzy2007-04-232007-04-231999-09http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR99-1766https://hdl.handle.net/1813/7420We investigate the completeness of Hoare Logic on the propositional level. In particular, the expressiveness requirements of Cook's proof are characterized propositionally. We give a completeness result for Propositional Hoare Logic (PHL): all relationally valid rules {b1}p1{c1}, ..., {bn}pn{cn} --------------------------- {b}p{c} are derivable in PHL, provided the propositional expressiveness conditions are met. Moreover, if the programs pi in the premises are atomic, no expressiveness assumptions are needed.135164 bytes126457 bytesapplication/pdfapplication/postscripten-UScomputer sciencetechnical reporttechnical report