Determining Implication of Fixed Matrix Prenex Normal Forms Can Be Decided in Linear Time

Abstract

For a fixed arbitrary matrix depending on $n$ variables, one may ask whether a Prenex Normal Form (PNF) implies another. A RAM algorithm running in linear time is presented and shown to be asymptotically optimal.