{"id":"palomar/PALOMAR-2026-11-21-000017","url":"https://github.com/Aritra-Pramanik/eml-richardson/tree/cd3512e9e5c0182e7905effcf3fcaf85f54dc8e7","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-11-21-000017-v1.json","repo":"https://github.com/Aritra-Pramanik/eml-richardson","tags":["math.LO","cs.LO","msc:03D35","msc:03B25","msc:26A09","msc:68V20"],"score":0,"title":"EML trees: zero-equivalence and root existence are undecidable, assuming Richardson's theorem","trust":"high","domain":"math.LO","source":"palomar","authors":["Aritra Pramanik"],"reviews":0,"subject":"math.LO","summary":"The binary operator eml(x, y) = exp(x) - ln(y), with the constant 1 and a variable x, generates the elementary functions (Odrzywolek, arXiv:2603.21852). We formalize, in Lean 4 with Mathlib, a computable translation of Richardson expressions (built from rationals, pi, ln 2, x, +, *, sin, exp and |.|) into EML trees evaluated over the complex numbers with the principal logarithm. The translation preserves the value at every real x, including 0 and negative values, and no compiled tree ever applies log to 0 at any real input. Consequently, assuming Richardson's theorem as an explicit…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-21","reactions":{},"formalized":true}