It corresponds to formulas which, when written in prenex normal form, have an $exists^*forall^*$ quantifier prefix and do not contain any function symbols.

This class of logic formulas is also sometimes referred as effectively propositional (EPR) since it can be effectively translated into propositional logic formulas by a process of grounding or instantiation.