I've worked with this theory for a while, but I've never been quite sure what to call it:
$$(\Sigma^*, =_{el}, \preceq, (S_a)_{a \in \Sigma})$$
Where
- $\Sigma^*$ is the set of finite words on finite alphabet $\Sigma$
- $x =_{el} y$ if $x$ and $y$ are equal length
- $x \preceq y$ if $x$ is a prefix of $y$
- $S_a(x)$ is $x$ concatenated with the letter $a$, for $a \in \Sigma$
"Decision Problems for Multiple Successor Arithmetics" (J.W. Thatcher) gives it the very generic name $N_k(r, \preceq, L)$.
"Relations Over Words and Logic: A Chronology" (C. Choffrut) attributes this logic to Eilenberg, Elgot and Shepherdson, and points out a paper where it's called $\mathbf{S}_\text{len}$, but this also seems to be a generic name.
For comparison, the equivalent weak monadic second order logic of one successor has a fairly standard name and abbreviation (WS1S), making it easy to search.
Does anyone who works with these sorts of logics have a preference for what to call this structure?