On Decidability of MSO Theories of Representable Matroids [chapter]

Petr Hliněný, Detlef Seese
2004 Lecture Notes in Computer Science  
We show that, for every finite field , the class of allrepresentable matroids of branch-width at most a constant t has a decidable MSO theory. In the other direction, we prove that every class of -representable matroids with a decidable MSO theory must have uniformly bounded branch-width.
doi:10.1007/978-3-540-28639-4_9 fatcat:36run6tgjrhtdpcu7ir6hdnxze