Decidable fragments of first-order modal logics with counting quantifiers over varying domains

Christopher Hampson

This paper explores the computational complexity of various natural one-variable fragments of first-order modal logics with the addition of counting quantifiers, over both constant…