All Questions
1 question
10
votes
2
answers
455
views
Is equivalence of functions built from nested exponentiations a decidable problem?
Let $\mathcal{E}$ be the minimal set of symbolic expressions (without any predefined meaning) such that
The symbol $x$ is in $\mathcal{E}$, and
If expressions $P,Q\in\mathcal{E}$, then the ...
- 1,699