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).
The finite satisfiability problem for guarded fixpoint logic is decidable and complete for 2ExpTime (resp. ExpTime for formulas of bounded width).
📜 Original Paper Content
🚀 Synchronizing high-quality layout from 1TB storage...