Guarded quantification in least fixed point logic
From MaRDI portal
The author develops a variant of least fixed point logic based on first-order logic with a relaxed version of guarded quantification. He develops a game-theoretic semantics of this logic, and finds that under reasonable conditions, guarding quantification does not reduce the expressibility of least fixed point logic. He also finds that the guarded version of a least fixed point algorithm may have a greater time complexity than the unguarded version, by a linear factor.
Recommendations
- Finite satisfiability for guarded fixpoint logic
- The complexity of boundedness for guarded logics
- Introduction to Guarded Logics
- Guards, bounds, and generalized semantics
- Automata for Guarded Fixed Point Logics
- Bisimulation quantifiers and uniform interpolation for guarded first order logic
- A note on guarded theories
- scientific article; zbMATH DE number 1341606
- scientific article; zbMATH DE number 1043779
- Fixed-point logics, generalized quantifiers, and oracles
Cited in
(3)
This page was built for publication: Guarded quantification in least fixed point logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1424969)