Wreath Products of Forest Algebras, with Applications to Tree Logics

Abstract

We use the recently developed theory of forest algebras to find algebraic characterizations of the languages of unranked trees and forests definable in various logics. These include the temporal logics CTL and EF, and first-order logic over the ancestor relation. While the characterizations are in general non-effective, we are able to use them to formulate necessary conditions for definability and provide new proofs that a number of languages are not definable in these logics.

Keywords

• computer science - logic in computer science
• computer science - formal languages and automata theory
• f.4.3