Characterizing Definability in Decidable Fixpoint Logics
international colloquium on automata languages and programming, 2017.
We look at characterizing which formulas are expressible in rich decidable logics such as guarded fixpoint logic, unary negation fixpoint logic, and guarded negation fixpoint logic. We consider semantic characterizations of definability, as well as effective characterizations. Our algorithms revolve around a finer analysis of the tree-mod...More
Full Text (Upload PDF)
PPT (Upload PPT)