Logic and Bisimulation for Guarded Teams
summary
Introduces guarded teams and proves characterization theorems: properties definable in team semantics that are invariant under guarded bisimulation correspond to guarded fragments of first order logic and to translations into existential second order logic. Distinguishes weak vs strong bisimulation and shows inclusion and exclusion atoms are invariant under the strong notion but not the weak one. Shows inclusion logic translates to a greatest fixed point fragment and on finite structures captures PTIME. Explores horizontal vs vertical guardedness and open questions for guarded fixpoint fragments.
AI-written summary · about
