descriptive complexity queries in these logics when restricted to finite structures have this computational complexity

Lower bounds Master theorem

NP PSPACE

Reductions