The binary EML operator yields all (transcendental) elementary functions by recursive application, or a binary tree. The structure of the operator itself carries two distinct ingredients: that of an abelian group, and of functional inverse, which reveal a constructive path to many distinct functional families.

翻译：二元EML算子通过递归应用（即生成一棵二叉树）产生所有（超越的）初等函数。该算子本身的结构蕴含两个不同成分：一个阿贝尔群结构和一个函数逆结构，这揭示了一条通向多种不同函数族群的构造性路径。