Computer Science – Logic in Computer Science
Scientific paper
2007-03-08
LMCS 3 (2:4) 2007
Computer Science
Logic in Computer Science
36 pages
Scientific paper
10.2168/LMCS-3(2:4)2007
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.
Colcombet Thomas
Löding Christof
No associations
LandOfFree
Transforming structures by set interpretations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Transforming structures by set interpretations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Transforming structures by set interpretations will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-642476