2026-07-31T14:56:38Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:10974 2024-03-06T10:46:57Z ddc:004 open_access

Two variable fragment of Term Modal Logic Padmanabha, Anantha Ramanujam, R. Term modal logic satisfiability problem two variable fragment decidability Term modal logics (TML) are modal logics with unboundedly many modalities, with quantification over modal indices, so that we can have formulas of the form Exists y Forall x (Box_x P(x,y) implies Diamond_y P(y,x)). Like First order modal logic, TML is also "notoriously" undecidable, in the sense that even very simple fragments are undecidable. In this paper, we show the decidability of one interesting fragment, that of two variable TML. This is in contrast to two-variable First order modal logic, which is undecidable. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Anantha Padmanabha and R. Ramanujam 2019 Is Part Of LIPIcs, Volume 138, 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.MFCS.2019.30 urn:nbn:de:0030-drops-109741 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.30 eng https://creativecommons.org/licenses/by/3.0/legalcode