论文信息 - On Monadic Second-Order Theories of Multidominance Structures

On Monadic Second-Order Theories of Multidominance Structures

Multidominance structures were introduced by Kracht [4] to provide a data structure for the formalisation of various aspects of GB-Theory. Kracht studied the PDL-theory of MDSes and showed that this theory is decidable in [5], actually 2EXPTIME-complete. He continues to conjecture that thus the MSO-theory of MDSes should be decidable, too. We show here the contrary. Actually, both the MSO-theory over vertices only and the MSO-theory over vertices and edges turn out to be undecidable.

Stephan Kepser | Stephan Kepser

[1] Marcus Kracht,et al. Syntax in Chains , 2001 .

[2] Bruno Courcelle,et al. The monadic second-order logic of graphs XIV: uniformly sparse graphs and edge set quantifications , 2003, Theor. Comput. Sci..

[3] Fritz Hamm,et al. On the logic of LGB type structures. Part I: Multidominance structures , 2008 .

[4] Detlef Seese,et al. The Structure of Models of Decidable Monadic Theories of Graphs , 1991, Ann. Pure Appl. Log..

[5] Paul D. Seymour,et al. Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.

[6] Fritz Hamm,et al. Logics for Linguistic Structures , 2008 .

[7] Bruno Courcelle,et al. Graph Rewriting: An Algebraic and Logic Approach , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[8] Marcus Kracht. On the Logic of LGB-Type Structures. Part I: Multidominance Structures , 2008 .

[9] Hans L. Bodlaender,et al. A Partial k-Arboretum of Graphs with Bounded Treewidth , 1998, Theor. Comput. Sci..

[10] J. Van Leeuwen,et al. Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .