Finite Satisfiability for Guarded Fixpoint Logic
  The finite satisfiability problem for guarded fixpoint logic is decidable and complete for 2ExpTime (resp. ExpTime for formulas of bounded width). 
Vince B\'ar\'any and Miko{\l}aj Boja\'nczyk
cs.LO math.LO