arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2406.17693cs.LOcs.FL
收藏

FO和LTL的正片段与单调片段

Positive and monotone fragments of FO and LTL

Denis Kuperberg, Quentin Moreau

AI总结:

本文研究有限字上正逻辑FO+及其片段,证明其与LTL+等逻辑的等价性,并给出一个FO可定义但非FO+可定义的单调语言反例,且该反例不可由FO2定义。

摘要:

我们研究有限字上的正逻辑FO+及其片段,延续并细化[Kuperberg 2023]中开创的工作。首先,我们将著名的逻辑等价性转置到正一阶逻辑中:FO+等价于LTL+,其带(resp.不带)后继的二变量片段FO2+等价于带(resp.不带)“下一个”算子X的UTL+。这表明尽管先前有负面结果,FO+-可定义语言类展现出某种鲁棒性。然后,我们展示一个在一元谓词上FO-可定义但非FO+-可定义的单调语言例子,细化了[Kuperberg 2023]中具有3个谓词的例子。此外,我们证明这样的反例不能是FO2-可定义的。

英文摘要:

We study the positive logic FO+ on finite words, and its fragments, pursuing and refining the work initiated in [Kuperberg 2023]. First, we transpose notorious logic equivalences into positive first-order logic: FO+ is equivalent to LTL+ , and its two-variable fragment FO2+ with (resp. without) successor available is equivalent to UTL+ with (resp. without) the "next" operator X available. This shows that despite previous negative results, the class of FO+-definable languages exhibits some form of robustness. We then exhibit an example of an FO-definable monotone language on one predicate, that is not FO+-definable, refining the example from [Kuperberg 2023] with 3 predicates. Moreover, we show that such a counter-example cannot be FO2-definable.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑