arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2011.02894cs.LO
收藏

无界团宽遗传类的 MSO 不可判定性

MSO Undecidability for Hereditary Classes of Unbounded Clique-Width

Anuj Dawar, Abhisekh Sankaran

AI总结:

本文研究了Seese猜想,指出若证明无界大小的网格能在无界团宽的极小遗传类及反链中被解释,即可确立MSO不可判定性,并证实了已知极小遗传类满足此条件。

摘要:

Seese 关于有限图的猜想指出,单体二阶逻辑(MSO)在所有无界团宽的图类上都是不可判定的。我们证明,为了确立这一点,只需证明无界大小的网格可以在两类图类中被解释:无界团宽的极小遗传类;以及在导出子图关系下无界团宽的反链。我们探讨了前一类中目前所有已知的类,并证实无界大小的网格确实可以在其中被解释。

英文摘要:

Seese's conjecture for finite graphs states that monadic second-order logic (MSO) is undecidable on all graph classes of unbounded clique-width. We show that to establish this it would suffice to show that grids of unbounded size can be interpreted in two families of graph classes: minimal hereditary classes of unbounded clique-width; and antichains of unbounded clique-width under the induced subgraph relation. We explore all the currently known classes of the former category and establish that grids of unbounded size can indeed be interpreted in them.

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

↑