Engine, P. (2026). Claim Verification: "The binary operator eml is defined by the expression \(\text{eml}(a, b) = \exp(a) - \ln(b)\). There exists a finite binary tree consisting solely of eml operations, whose 9 leaves are drawn from \(\{1, x, y\}\), such that the tree evaluates exactly to \(x \times y\). The tree has K = 17 tokens (8 eml operations and 9 leaves), and the identity holds for all complex \(x\) and \(y\) (in the algebraic setting where \(\ln \circ \exp\) is the identity)." — Proved. Zenodo.
Чикаго стиль цитування (17-те видання)Engine, Proof. Claim Verification: "The Binary Operator Eml Is Defined by the Expression \(\text{eml}(a, B) = \exp(a) - \ln(b)\). There Exists a Finite Binary Tree Consisting Solely of Eml Operations, Whose 9 Leaves Are Drawn from \(\{1, X, Y\}\), Such That the Tree Evaluates Exactly to \(x \times Y\). The Tree Has K = 17 Tokens (8 Eml Operations and 9 Leaves), and the Identity Holds for All Complex \(x\) and \(y\) (in the Algebraic Setting Where \(\ln \circ \exp\) Is the Identity)." — Proved. Zenodo, 2026.
Стиль цитування MLA (9-ме видання)Engine, Proof. Claim Verification: "The Binary Operator Eml Is Defined by the Expression \(\text{eml}(a, B) = \exp(a) - \ln(b)\). There Exists a Finite Binary Tree Consisting Solely of Eml Operations, Whose 9 Leaves Are Drawn from \(\{1, X, Y\}\), Such That the Tree Evaluates Exactly to \(x \times Y\). The Tree Has K = 17 Tokens (8 Eml Operations and 9 Leaves), and the Identity Holds for All Complex \(x\) and \(y\) (in the Algebraic Setting Where \(\ln \circ \exp\) Is the Identity)." — Proved. Zenodo, 2026.