paper

Inexpressibility in Exp-Minus-Log

arXiv:2605.01636

Abstract

Odrzywołek defined a system Exp-Minus-Log (EML) that reduces all elementary functions over complex numbers down to a constant `', and a single two place function . This paper shows that in this system, equivalent to Chow's EL numbers, every EML-expressible number is computable. We go on to prove that the canonical example of a non-computable real, Chaitin's , is inexpressible in EML. This gives a formal inexpressibility theorem for this system.

5 pages

Inexpressibility in Exp-Minus-Log · wovepaper