Start here: what is EML?
EML stands for the binary operator eml(x, y) = exp(x) − ln(y).
The 2026 paper "All Elementary Functions from a Single Operator" by Andrzej Odrzywołek proves that this single operator, paired with the constant 1, is enough to reconstruct every elementary mathematical function you'd find on a scientific calculator.
The one-line claim
Every elementary function you know, sin, cos, ln, exp, +, ×, ÷, π, e, can be written as a nested tree of eml calls whose leaves are all the number 1.
Why care?
Boolean logic has this property too. The NAND gate alone is enough to build every digital circuit. We call such operators Sheffer strokes. Before this paper, continuous mathematics had no known Sheffer stroke. It does now.
What you can do here
- Open the Playground to build and evaluate your own EML expressions.
- Browse the Function Gallery to see how familiar functions decompose.
- Dig into the reduction journey and depth table.
Prerequisites
If you remember what exp and ln are and you've seen a binary tree in a data-structures class, you have everything you need.