具有计数的MTL的表达性
The expressiveness of MTL with counting
摘要:
众所周知,具有整数端点的MTL不能表示所有的一元一阶序度量逻辑(FO(<,+1))。实际上,MTL不能表达断言属性在下一时间间隔中保持$n$次数的计数模态$C_n$。我们表明,MTL与计数方式,MTL+C,是表达完整的FO(<,+1)。这一结果有力地支持了Hirshfeld和Rabinovich的断言,即Q2MLO是FO(<,+1)最具表达力的可判定片段。
英文摘要:
It is well known that MTL with integer endpoints is unable to express all of monadic first-order logic of order and metric (FO(<,+1)). Indeed, MTL is unable to express the counting modalities $C_n$ that assert a properties holds $n$ times in the next time interval. We show that MTL with the counting modalities, MTL+C, is expressively complete for FO(<,+1). This result strongly supports the assertion of Hirshfeld and Rabinovich that Q2MLO is the most expressive decidable fragments of FO(<,+1).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。