Skip to main content
SpringerLink
Log in

On Decidability of MSO Theories of Representable Matroids

  • Conference paper
Parameterized and Exact Computation (IWPEC 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3162))

Included in the following conference series:

Abstract

We show that, for every finite field \(\mathbb F\), the class of all \(\mathbb F\)-representable matroids of branch-width at most a constant t has a decidable MSO theory. In the other direction, we prove that every class of \(\mathbb F\)-representable matroids with a decidable MSO theory must have uniformly bounded branch-width.

2000 Math subject classification: 03B25, 05B35, 68R05, 68R10, 03B15.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arnborg, S., Lagergren, J., Seese, D.: Easy Problems for Tree-Decomposable Graphs. Journal of Algorithms 12, 308–340 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  2. Courcelle, B.: The decidability of the monadic second order theory of certain sets of finite and infinite graphs. In: Logic in Computer Science, LICS 1988, Edinburg (1988)

    Google Scholar 

  3. Courcelle, B.: The Monadic Second-Order Logic of Graphs I. Recognizable sets of Finite Graphs. Information and Computation 85, 12–75 (1990)

    MATH  MathSciNet  Google Scholar 

  4. Courcelle, B.: The monadic second order logic of graphs VI: on several representations of graphs by relational structures. Discrete Appl. Math. 54, 117–149 (1994); Erratum 63, 199–200 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  5. Courcelle, B.: The monadic second-order logic of graphs XIV: Uniformly sparse graphs and edge set quantification. Theoretical Computer Science 299, 1–36 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  6. Courcelle, B.: The Monadic Second-Order Logic of Graphs XV: On a Conjecture by D. Seese, LaBri, Bordeaux 1 University, March 8, 1–40 (2004) (manuscript)

    Google Scholar 

  7. Courcelle, B., Makowsky, J.A., Rotics, U.: Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width. Theory Comput. Systems 33, 125–150 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  8. Courcelle, B., Mosbah, M.: Monadic second-order evaluations on tree-decomposable graphs. Theoret. Comput. Sci. 109, 49–82 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  9. Ebbinghaus, H.-D., Flum, J., Thomas, W.: Mathematical Logic, 2nd edn. Springer, Heidelberg (1994)

    MATH  Google Scholar 

  10. Geelen, J.F., Gerards, A.H.M., Whittle, G.P.: Branch-Width and Well-Quasi-Ordering in Matroids and Graphs. J. Combin. Theory Ser. B 84, 270–290 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  11. Geelen, J.F., Gerards, A.H.M., Whittle, G.P.: Excluding a Planar Graph from a GF(q)-Representable Matroid (2003) (manuscript)

    Google Scholar 

  12. Gurevich, Y.: Monadic second-order theories. In: Model-Theoretic Logics, ch. XIII, pp. 479–506. Springer, New York (1985)

    Google Scholar 

  13. Hliněný, P.: Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 319–330. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  14. Hliněný, P.: On Matroid Properties Definable in the MSO Logic. In: Rovan, B., Vojtáš, P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 470–479. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  15. Hliněný, P., Whittle, G.P.: Matroid Tree-Width. In: Extended abstract in: Eurocomb 2003, Charles University, Prague, Czech Republic. ITI Series 2003–145, pp. 202–205 (2003) (submitted)

    Google Scholar 

  16. Oxley, J.G.: Matroid Theory. Oxford University Press, Oxford (1992)

    MATH  Google Scholar 

  17. Rabin, M.O.: A simple method for undecidability proofs and some applications. In: Bar-Hillel (ed.) Logic, Methodology and Philosophy of Sciences 1, pp. 58–68. North-Holland, Amsterdam (1964)

    Google Scholar 

  18. Rabin, M.O.: Decidable theories. In: Handbook of Mathematical Logic, J. Barwise, ch. C.3, pp. 595–629. North-Holland Publ.Co., Amsterdam (1977)

    Chapter  Google Scholar 

  19. Robertson, N., Seymour, P.D.: Graph Minors – A Survey, Surveys in Combinatorics, pp. 153–171. Cambridge Univ. Press, Cambridge (1985)

    Google Scholar 

  20. Robertson, N., Seymour, P.D.: Graph Minors X. Obstructions to Tree-Decomposition. J. Combin. Theory Ser. B 52, 153–190 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  21. Seese, D.: Ein Unentscheidbarkeitskriterium, Wissenschaftliche Zeitschrift der Humboldt-Universitaet zu Berlin. Math.-Nat. R. XXIV 6, 772–778 (1975)

    MathSciNet  Google Scholar 

  22. Seese, D.: The structure of the models of decidable monadic theories of graphs. Annals of Pure and Aplied Logic 53, 169–195 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  23. Seese, D.: Interpretability and Tree Automata: a simple way to solve Algorithmic Problems on Graphs closely related to Trees. In: Nivat, M., Podelski, A. (eds.) Tree Automata and Languages, pp. 83–114. Elsevier Sceince Publishers, Amsterdam (1992)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, VŠB – Technical University of Ostrava, 17. listopadu 15, 70833, Ostrava, Czech Republic

    Petr Hliněný

  2. Institute AIFB, University Karlsruhe (TH), D-76128, Karlsruhe, Germany

    Detlef Seese

Authors
  1. Petr Hliněný
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Detlef Seese
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Mathematics, Statistics, and Computer Science, Victoria University, PO Box 600, Wellington, New Zealand

    Rod Downey

  2. PCRU, Office of DVC (Research), University of Newcastle, Australia

    Michael Fellows

  3. Carleton University, Ottawa, Canada

    Frank Dehne

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hliněný, P., Seese, D. (2004). On Decidability of MSO Theories of Representable Matroids. In: Downey, R., Fellows, M., Dehne, F. (eds) Parameterized and Exact Computation. IWPEC 2004. Lecture Notes in Computer Science, vol 3162. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28639-4_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-28639-4_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23071-7

  • Online ISBN: 978-3-540-28639-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation