## The Structure of the Models of Decidable Monadic Theories of Graphs (1991)

by
D. Seese

Citations: | 47 - 2 self |

### BibTeX

@MISC{Seese91thestructure,

author = {D. Seese},

title = {The Structure of the Models of Decidable Monadic Theories of Graphs},

year = {1991}

}

### Years of Citing Articles

### OpenURL

### Abstract

In this article the structure of the models of decidable (weak) monadic theories of planar graphs is investigated. It is shown that if the (weak) monadic theory of a class K of planar graphs is decidable, then the tree-width in the sense of Robertson and Seymour (1984) of the elements of K is universally bounded and there is a class T of trees such that the (weak) monadic theory of K is interpretable in the (weak) monadic theory of T.