| dc.contributor.author | Hliněný, Petr | |
| dc.contributor.author | Seese, Detlef | |
| dc.date.accessioned | 2006-10-05T13:09:35Z | |
| dc.date.available | 2006-10-05T13:09:35Z | |
| dc.date.issued | 2004 | |
| dc.identifier.citation | Parameterized and exact computation : First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004. Proceedings. 2006, p. 96-107. | en |
| dc.identifier.isbn | 978-3-540-23071-7 | |
| dc.identifier.issn | 0302-9743 | |
| dc.identifier.uri | http://hdl.handle.net/10084/56866 | |
| dc.description.abstract | We show that, for every finite field , the class of all -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 -representable matroids with a decidable MSO theory must have uniformly bounded branch-width. | en |
| dc.language.iso | en | en |
| dc.publisher | Springer | en |
| dc.relation.ispartofseries | Parameterized and exact computation : First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004. Proceedings | en |
| dc.relation.uri | http://dx.doi.org/10.1007/b100584 | en |
| dc.subject | matroid | en |
| dc.subject | branch-width | en |
| dc.subject | MSO theory | en |
| dc.subject | decidability | en |
| dc.title | On decidability of MSO theories of representable matroids | en |
| dc.type | article | en |
| dc.identifier.location | Není ve fondu ÚK | en |
| dc.identifier.doi | 10.1007/b100584 | |
| dc.identifier.wos | 000223981800009 | |