Wreath Products of Forest Algebras, with Applications to Tree Logics

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.

💡 Research Summary

The paper presents a novel algebraic framework for characterising the expressive power of several logics over unranked trees and forests. The authors build on the recently introduced theory of forest algebras, which consists of a pair of finite algebras—a forest algebra F that recognises collections of trees (forests) and a context algebra C that models tree contexts with a single hole. The interaction between F and C captures the essential operations of inserting a forest into a context, thereby providing a natural algebraic model for tree languages.

The central technical contribution is the definition and systematic use of the wreath product (also called the “wreath sum” in the paper) for forest algebras. Given two forest algebras A and B, the wreath product A ∘ B is constructed so that A controls the choice of contexts while B supplies the concrete labels that fill those contexts. This mirrors the hierarchical nature of many temporal and first‑order logics on trees: a high‑level operator selects a sub‑forest (the “outer” algebra) and a lower‑level operator evaluates properties inside that sub‑forest (the “inner” algebra). By iterating the wreath product, one can build arbitrarily deep hierarchies of logical operators.

Using this construction, the authors obtain algebraic characterisations for three well‑studied logics:

1. CTL (Computation Tree Logic).
   CTL is generated by the path operators EX, EU and EF. The paper shows that a forest language is definable in CTL if and only if it is recognised by a forest algebra that belongs to the closure under wreath product of the class EF‑closed algebras. In other words, CTL‑definable languages are exactly those that can be built from EF‑closed algebras by repeatedly applying the wreath product.

2. EF (the fragment of CTL containing only the “exists‑finally” operator).
   For EF the characterisation collapses: a language is EF‑definable precisely when it is recognised by an EF‑closed forest algebra. No further wreathing is needed because EF already captures the essential context‑insertion behaviour.

3. **First‑order logic with the ancestor relation, FO