On decidability of MSO theories of representable matroids

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3162, Issue , 2004, Pages 96-107

  Hliněný, Petr ^a,c   Seese, Detlef ^b  

^a VSB TECHNICAL UNIVERSITY OF OSTRAVA   (Czech Republic)

^b UNIVERSITY OF KARLSRUHE   (Germany)

^c MATEJ BEL UNIVERSITY   (Slovakia)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTABILITY AND DECIDABILITY; GRAPH THEORY; MATRIX ALGEBRA;

BRANCH-WIDTH; FINITE FIELDS; MSO THEORY; UNIFORMLY BOUNDED;

COMPUTATION THEORY;

EID: 32144453056     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28639-4_9     Document Type: Article

References (25)

1. S. Arnborg, J. Lagergren, D. Seese, Easy Problems for Tree-Decomposable Graphs, Journal of Algorithms 12 (1991), 308-340.
2. B. Courcelle, The decidability of the monadic second order theory of certain sets of finite and infinite graphs, LICS'88, Logic in Computer Science, Edinburg, 1988.
3. B. Courcelle, The Monadic Second-Order Logic of Graphs I. Recognizable sets of Finite Graphs, Information and Computation 85 (1990), 12-75.
4. B. Courcelle, The monadic second order logic of graphs VI: on several representations of graphs by relational structures, Discrete Appl. Math. 54 (1994) 117-149. Erratum 63 (1995) 199-200.
5. B. Courcelle, The monadic second-order logic of graphs XIV: Uniformly sparse graphs and edge set quantification, Theoretical Computer Science 299 (2003) 1-36.
6. B. Courcelle, The Monadic Second-Order Logic of Graphs XV: On a Conjecture by D. Seese, manuscript, LaBri, Bordeaux 1 University, March 8, 2004, 1-40.
7. B. Courcelle, J.A. Makowsky, U. Rotics, Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width, Theory Comput. Systems 33 (2000) 125-150.
8. B. Courcelle, M. Mosbah, Monadic second-order evaluations on tree-decomposable graphs, Theoret. Comput. Sci. 109 (1993), 49-82.
9. H.-D. Ebbinghaus, J. Flum, W. Thomas, Mathematical Logic, Springer Verlag, 2nd edition, 1994.
10. J.F. Geelen, A.H.M. Gerards, G.P. Whittle, Branch-Width and Well-Quasi-Ordering in Matroids and Graphs, J. Combin. Theory Ser. B 84 (2002), 270-290.
11. J.F. Geelen, A.H.M. Gerards, G.P. Whittle, Excluding a Planar Graph from a GF(q)-Representable Matroid, manuscript, 2003.
12. Y. Gurevich, Monadic second-order theories, In: Chapter XIII from J. Barwise, S. Feferman: Model-Theoretic Logics; Springer-Verlag New York 1985, 479-506.
13. P. Hliněný, Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids, submitted.
14. Extended abstract in: STAGS 2003, Lecture Notes in Computer Science 2607, Springer Verlag (2003), 319-330.
15. P. Hliněný, On Matroid Properties Definable in the MSO Logic, In: Math Foundations of Computer Science MFCS 2003, Lecture Notes in Computer Science 2747, Springer Verlag Berlin (2003), 470-479.
16. P. Hliněný, G.P. Whittle, Matroid Tree-Width, submitted, 2003.
17. Extended abstract in: Eurocomb'03, ITI Series 2003-145, Charles University, Prague, Czech Republic, 202-205.
18. J.G. Oxley, Matroid Theory, Oxford University Press, 1992.
19. M.O. Rabin, A simple method for undecidability proofs and some applications, Logic, Methodology and Philosophy of Sciences 1 (ed. Bar-Hillel), North-Holland, Amsterdam 1964, 58-68.
20. M.O. Rabin, Decidable theories, In: Chapter C.3 of Handbook of Mathematical Logic, J. Barwise, North-Holland Publ.Co. 1977, 595-629.
21. N. Robertson, P.D. Seymour, Graph Minors - A Survey, Surveys in Combinatorics, Cambridge Univ. Press 1985, 153-171.
22. N. Robertson, P.D. Seymour, Graph Minors X. Obstructions to Tree-Decomposition, J. Combin. Theory Ser. B 52 (1991), 153-190.
23. D. Seese, Ein Unentscheidbarkeitskriterium, Wissenschaftliche Zeitschrift der Humboldt-Universitaet zu Berlin, Math.-Nat. R. XXIV (1975) 6, 772-778.
24. D. Seese, The structure of the models of decidable monadic theories of graphs, Annals of Pure and Aplied Logic 53 (1991), 169-195.
25. D. Seese, Interpretability and Tree Automata: a simple way to solve Algorithmic Problems on Graphs closely related to Trees, In: Tree Automata and Languages, M. Nivat and A. Podelski (editors), Elsevier Sceince Publishers 1992, 83-114.