Modal logic of planar polygons

Open Access
Authors
  • D. Gabelaia
  • K. Gogoladze
  • M. Jibladze
  • E. Kuznetsov
Publication date 08-07-2018
Edition 1
Number of pages 22
Publisher Amsterdam: ILPS, Informatics Institute, Universiteit van Amsterdam
Organisations
  • Faculty of Science (FNWI) - Informatics Institute (IVI)
Abstract We study the modal logic of the closure algebra P2, generated by the set of all
polygons in the Euclidean plane R2. We show that this logic is finitely axioma-
tizable, is complete with respect to the class of frames we call “crown” frames,
is not first order definable, does not have the Craig interpolation property, and
its validity problem is PSpace-complete.
Document type Working paper
Note Version 1.
Language English
Published at https://arxiv.org/abs/1807.02868v1
Downloads
33092719 (Final published version)
Permalink to this page
Back