Abstract
We consider a new kind of interpretation over relational structures: finite sets interpretations. Those interpretations are defined by weak monadic second-order (WMSO) formulas with free set variables. They transform a given structure into a structure with a domain consisting of finite sets of elements of the orignal structure. The definition of these interpretations directly implies that they send structures with a decidable WMSO theory to structures with a decidable first-order theory. In this paper, we investigate the expressive power of such interpretations applied to infinite deterministic trees. The results can be used in the study of automatic and tree-automatic structures.
Author supplied keywords
Cite
CITATION STYLE
Colcombet, T., & Löding, C. (2007). Transforming structures by set interpretations. Logical Methods in Computer Science , 3(2). https://doi.org/10.2168/LMCS-3(2:4)2007
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.