Name
Abstract | ||
|---|---|---|
We compare classes of finite relational structures via monadic second-order transductions. More precisely, we study the preorder where we set C subset of K if, and only if, there exists a transduction tau such that C subset of tau(K). If we only consider classes of incidence structures we can completely describe the resulting hierarchy. It is linear of order type omega+3. Each level can be characterised in terms of a suitable variant of tree-width. Canonical representatives of the various levels are: the class of all trees of height n, for each n is an element of N, of all paths, of all trees, and of all grids. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.2168/LMCS-6(2:2)2010 | LOGICAL METHODS IN COMPUTER SCIENCE |
Keywords | Field | DocType |
Monadic Second-Order Logic,Guarded Second-Order Logic,Transductions,Hypergraphs | Discrete mathematics,Combinatorics,Existential quantification,Preorder,Order type,If and only if,Hierarchy,Monad (functional programming),Mathematics | Journal |
Volume | Issue | ISSN |
6 | 2 | 1860-5974 |
Citations | PageRank | References |
4 | 0.46 | 18 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Achim Blumensath | 1 | 140 | 15.35 |
| Bruno Courcelle | 2 | 3418 | 388.00 |