Inexpressibility in Exp-Minus-Log (EML)
5 hours ago
- #logic
- #expressibility
- #computability
- Exp-Minus-Log (EML) system reduces elementary functions to a constant 1 and function E(α,β)=exp(α)-log(β).
- Every EML-expressible number is shown to be computable, equivalent to Chow's EL numbers.
- Chaitin's Ω_U, a canonical non-computable real, is proven inexpressible in EML, establishing a formal inexpressibility theorem.