Finite satisfiability for guarded fixpoint logic
From MaRDI portal
Abstract: The finite satisfiability problem for guarded fixpoint logic is decidable and complete for 2ExpTime (resp. ExpTime for formulas of bounded width).
Cites work
Cited in
(5)
This page was built for publication: Finite satisfiability for guarded fixpoint logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436331)