Lower Bounds for Dynamic Complexity Classes

In the traditional static setting, several methods for proving inexpressibility results have been developed.