In this paper, we present a prenex form theorem for a version of Independence Friendly logic, a logic with imperfect information.
Lifting classical results to such logics turns out not to be straightforward, because independence conditions make the formulas
sensitive to signalling phenomena. In particular, nested quantification over the same variable is shown to cause problems.
For instance, renaming of bound variables may change the interpretations of a formula, there are only restricted quantifier
extraction theorems, and slashed connectives cannot be so easily removed. Thus we correct some claims from Hintikka , Caicedo
& Krynicki  and Hodges . We refine definitions, in particular the notion of equivalence, and sharpen preconditions,
allowing us to restore (restricted versions of) those claims, including the prenex form theorem of Caicedo & Krynicki
, and, as a side result, we obtain an application to Skolem forms of classical formulas. It is a known fact that a complete
calculus for IF-logic is impossible, but with our results we establish several quantifier rules that form a partial calculus
of equivalence for a general version of IF-logic reflecting general properties of information flow in games.