Lower bounds in Dynamic Complexity

Unconditional lower bounds are are hard to prove. For this
reason recent work on inexpressibility for dynamic complexity has been
centered around fragments of DynFO (i.e. the class of queries
maintainable using first-order formulas). In this talk I will survey the
state of the art of dynamic lower bounds, with a strong focus on the
quantifier-free fragment of DynFO.