7 citations · 14 across the 5 of their papers we have counts for
5 papers · 1 filter
Decidability in First-Order Modal Logic with Non-Rigid Constants and Definite Descriptions
Alessandro Artale, Christopher Hampson, Roman Kontchakov +2
While modal extensions of decidable fragments of first-order logic are usually undecidable, their monodic counterparts, in which formulas in the scope of modal operators have at mo…
Non-finitely axiomatisable modal product logics with infinite canonical axiomatisations
Christopher Hampson, Stanislav Kikot, Agi Kurucz +1
Our concern is the axiomatisation problem for modal and algebraic logics that correspond to various fragments of two-variable first-order logic with counting quantifiers. In partic…
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…
The decision problem of modal product logics with a diagonal, and faulty counter machines
Christopher Hampson, Stanislav Kikot, Agi Kurucz
In the propositional modal (and algebraic) treatment of two-variable first-order logic equality is modelled by a `diagonal' constant, interpreted in square products of universal fr…
Undecidable propositional bimodal logics and one-variable first-order linear temporal logics with counting
Christopher Hampson, Agi Kurucz
First-order temporal logics are notorious for their bad computational behaviour. It is known that even the two-variable monadic fragment is highly undecidable over various linear t…