On decidability of MSO theories of representable matroids
Loading...
Downloads
Date issued
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Springer
Location
Není ve fondu ÚK
Signature
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.
Description
Delayed publication
Available after
Subject(s)
matroid, branch-width, MSO theory, decidability
Citation
Parameterized and exact computation : First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004. Proceedings. 2006, p. 96-107.