Answers are grounded in this paper and cite their sources.
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 ∃ y. ∀ x. (ₓ P(x,y) ⊃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.
No takes yet. Share an insight, caveat, or question.
Padmanabha et al. (2019) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: