Succinctness of Order-Invariant Logics on Depth-Bounded Structures
Succinctness of Order-Invariant Logics on Depth-Bounded Structures
复制标题
深度有界结构上的阶不变逻辑的简洁性
DOI:
10.1145/3152770
复制
发表时间:
2017
期刊:
影响因子:
--
通讯作者:
F. Harwath
中科院分区:
文献类型:
--
作者:
K. Eickmeyer;M. Elberfeld;F. Harwath
We study the expressive power and succinctness of order-invariant sentences of first-order (FO) and monadic second-order (MSO) logic on structures of bounded tree-depth. Order-invariance is undecidable in general and, thus, one strives for logics with a decidable syntax that have the same expressive power as order-invariant sentences. We show that on structures of bounded tree-depth, order-invariant FO has the same expressive power as FO. Our proof technique allows for a fine-grained analysis of the succinctness of this translation. We show that for every order-invariant FO sentence there exists an FO sentence whose size is elementary in the size of the original sentence, and whose number of quantifier alternations is linear in the tree-depth. We obtain similar results for MSO. It is known that the expressive power of MSO and FO coincide on structures of bounded tree-depth. We provide a translation from MSO to FO and we show that this translation is essentially optimal regarding the formula size. As a further result, we show that order-invariant MSO has the same expressive power as FO with modulo-counting quantifiers on bounded tree-depth structures.
登录
查看更多内容
DOI:
--
发表时间:
2010
期刊:
2010 25th Annual IEEE Symposium on Logic in Computer Science
影响因子:
--
作者:
Nicole Schweikardt;L. Segoufin
通讯作者:
L. Segoufin
DOI:
--
发表时间:
2012
期刊:
Foundations of Software Technology and Theoretical Computer Science
影响因子:
--
作者:
Jakub Gajarský;Petr Hliněný
通讯作者:
Petr Hliněný
DOI:
--
发表时间:
2013
期刊:
Computer Science Symposium in Russia
影响因子:
--
作者:
Nicole Schweikardt
通讯作者:
Nicole Schweikardt
DOI:
10.1145/2946799
发表时间:
2012
期刊:
2012 27th Annual IEEE Symposium on Logic in Computer Science
影响因子:
--
作者:
Michael Elberfeld;Martin Grohe;Till Tantau
通讯作者:
Till Tantau