Add to ORKGAbstract. 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
AbstractHliněný [P. Hliněný, Branch-width, parse trees, and monadic second-order logic for matroids,...
AbstractWe prove that a represented infinite matroid having finite tree-width w has a linked tree-de...
AbstractWe prove that a class of matroids representable over a fixed finite field and with bounded b...
Monadic second order (MSO) logic proved to be a useful tool in many areas of application, reaching f...
AbstractMonadic second order (MSO) logic has proved to be a useful tool in many areas of application...
AbstractMonadic second order (MSO) logic has proved to be a useful tool in many areas of application...
A (d,¿)-net in a matroid M is a pair where N is a minor of M, is a set of series classes in N, , and...
A (d,¿)-net in a matroid M is a pair where N is a minor of M, is a set of series classes in N, , and...
A (d,¿)-net in a matroid M is a pair where N is a minor of M, is a set of series classes in N, , and...
A (d,¿)-net in a matroid M is a pair where N is a minor of M, is a set of series classes in N, , and...
A (d,¿)-net in a matroid M is a pair where N is a minor of M, is a set of series classes in N, , and...
Hlineny's Theorem shows that any sentence in the monadic second-order logic of matroids can be teste...
Let $\psi$ be a sentence in the counting monadic second-order logic of matroids. Let F be a finite f...
AbstractA notion of branch-width, which generalizes the one known for graphs, can be defined for mat...
We introduce "matroid parse trees" which, using only a limited amount of information at each node, c...
AbstractHliněný [P. Hliněný, Branch-width, parse trees, and monadic second-order logic for matroids,...
AbstractWe prove that a represented infinite matroid having finite tree-width w has a linked tree-de...
AbstractWe prove that a class of matroids representable over a fixed finite field and with bounded b...
Monadic second order (MSO) logic proved to be a useful tool in many areas of application, reaching f...
AbstractMonadic second order (MSO) logic has proved to be a useful tool in many areas of application...
AbstractMonadic second order (MSO) logic has proved to be a useful tool in many areas of application...
A (d,¿)-net in a matroid M is a pair where N is a minor of M, is a set of series classes in N, , and...
A (d,¿)-net in a matroid M is a pair where N is a minor of M, is a set of series classes in N, , and...
A (d,¿)-net in a matroid M is a pair where N is a minor of M, is a set of series classes in N, , and...
A (d,¿)-net in a matroid M is a pair where N is a minor of M, is a set of series classes in N, , and...
A (d,¿)-net in a matroid M is a pair where N is a minor of M, is a set of series classes in N, , and...
Hlineny's Theorem shows that any sentence in the monadic second-order logic of matroids can be teste...
Let $\psi$ be a sentence in the counting monadic second-order logic of matroids. Let F be a finite f...
AbstractA notion of branch-width, which generalizes the one known for graphs, can be defined for mat...
We introduce "matroid parse trees" which, using only a limited amount of information at each node, c...
AbstractHliněný [P. Hliněný, Branch-width, parse trees, and monadic second-order logic for matroids,...
AbstractWe prove that a represented infinite matroid having finite tree-width w has a linked tree-de...
AbstractWe prove that a class of matroids representable over a fixed finite field and with bounded b...