APA (7th ed.) Citation

Engine, P. (2026). Claim Verification: "The binary operator eml is defined by the expression \(\text{eml}(a, b) = \exp(a) - \ln(b)\) (where exp is the exponential function and ln is the principal branch of the natural logarithm). For every real \(x > 0\), the nested expression \(\text{eml}(1, \text{eml}(\text{eml}(1, x), 1))\) equals the natural logarithm \(\ln(x)\)." — Proved. Zenodo.

Chicago Style (17th ed.) Citation

Engine, Proof. Claim Verification: "The Binary Operator Eml Is Defined by the Expression \(\text{eml}(a, B) = \exp(a) - \ln(b)\) (where Exp Is the Exponential Function and Ln Is the Principal Branch of the Natural Logarithm). For Every Real \(x > 0\), the Nested Expression \(\text{eml}(1, \text{eml}(\text{eml}(1, X), 1))\) Equals the Natural Logarithm \(\ln(x)\)." — Proved. Zenodo, 2026.

MLA (9th ed.) Citation

Engine, Proof. Claim Verification: "The Binary Operator Eml Is Defined by the Expression \(\text{eml}(a, B) = \exp(a) - \ln(b)\) (where Exp Is the Exponential Function and Ln Is the Principal Branch of the Natural Logarithm). For Every Real \(x > 0\), the Nested Expression \(\text{eml}(1, \text{eml}(\text{eml}(1, X), 1))\) Equals the Natural Logarithm \(\ln(x)\)." — Proved. Zenodo, 2026.