## Relating the PSPACE reasoning power of Boolean Programs and Quantified Boolean Formulas (2000)

by
Alan Skelley

Citations: | 13 - 9 self |

### BibTeX

@MISC{Skelley00relatingthe,

author = {Alan Skelley},

title = {Relating the PSPACE reasoning power of Boolean Programs and Quantified Boolean Formulas},

year = {2000}

}

### OpenURL

### Abstract

We present a new propositional proof system based on a recent new characterization of polynomial space (PSPACE) called Boolean Programs, due to Cook and Soltys. We show that this new system, BPLK, is polynomially equivalent to the system G, which is based on the familiar and very different quantified Boolean formula (QBF) characterization of PSPACE due to Stockmeyer and Meyer. We conclude with a discussion of some closely related open problems and their implications.