Is QBF a special case of predicale logic?

Hello,

I've asked a similar question on 'sci.math' already but do not get a
answer (which I do understand) to the following:

Can one speak of QBL (quantified boolean logic) as a special case of
predicate logic in the following sense:
QBL is predicate logic with the restriction that there are no n-
relations and no n-functions for n>0?
(0-functions are just variables and 0-relations are just constants)

Thanks,
S.
.