Equivalence closure in the two-variable guarded fragment

@article{Kieronski2017EquivalenceCI,
  title={Equivalence closure in the two-variable guarded fragment},
  author={Emanuel Kieronski and Ian Pratt-Hartmann and Lidia Tendera},
  journal={J. Log. Comput.},
  year={2017},
  volume={27},
  pages={999-1021}
}
We consider the satisfiability and finite satisfiability problems for the extension of the two-variable guarded fragment in which an equivalence closure operator can be applied to two distinguished binary predicates. We show that the satisfiability and finite satisfiability problems for this logic are 2-ExpTime-complete. This contrasts with an earlier… CONTINUE READING