Tree Languages Defined in First-Order Logic with One Quantifier Alternation
We study tree languages that can be defined in Delta_2 . These are tree languages definable by a first-order formula whose quantifier prefix is forall exists, and simultaneously by a first-order form
We study tree languages that can be defined in \Delta_2 . These are tree languages definable by a first-order formula whose quantifier prefix is forall exists, and simultaneously by a first-order formula whose quantifier prefix is . For the quantifier free part we consider two signatures, either the descendant relation alone or together with the lexicographical order relation on nodes. We provide an effective characterization of tree and forest languages definable in \Delta_2 . This characterization is in terms of algebraic equations. Over words, the class of word languages definable in \Delta_2 forms a robust class, which was given an effective algebraic characterization by Pin and Weil.
💡 Research Summary
The paper investigates the class Δ₂ of tree and forest languages, i.e., languages that can be described both by a first‑order formula whose quantifier prefix is ∀∃ and by a first‑order formula whose prefix is ∃∀. Two logical signatures are considered. The first uses only the descendant (ancestor‑descendant) relation, while the second enriches this with the lexicographic order on sibling nodes. For each signature the authors give a complete, effective algebraic characterization of the Δ₂‑definable languages.
The algebraic framework employed is that of forest algebras, a pair (H,V) of monoids where H captures horizontal composition (concatenation of forests) and V captures vertical composition (application of contexts). For any language L the minimal (syntactic) forest algebra (H_L,V_L) recognises L, and the expressive power of a logical fragment can be read off from algebraic identities satisfied by (H_L,V_L).
The main results are two characterisation theorems.
- Signature with only the descendant relation. A forest language L belongs to Δ₂ iff its syntactic forest algebra satisfies three algebraic conditions: (i) the vertical monoid V_L is aperiodic and J‑trivial, (ii) the horizontal monoid H_L is idempotent and commutative, and (iii) the following ω‑identity holds for all u∈V_L and v∈H_L:
\
📜 Original Paper Content
🚀 Synchronizing high-quality layout from 1TB storage...