
Summary: We show that in the ring generated by the integers and the functions \(x, \sin x^{n}\) and \(\sin(x\cdot \sin x^{n})\) \((n=1,2,\ldots)\) defined on \(\mathbf{R}\) it is undecidable whether or not a function has a positive value or has a root. We also prove that the existential theory of the exponential field \(\mathbf{C} \) is undecidable.
Decidability of theories and sets of sentences, undecidable problems, rings of elementary functions, Elementary functions, Word problems, etc. in computability and recursion theory
Decidability of theories and sets of sentences, undecidable problems, rings of elementary functions, Elementary functions, Word problems, etc. in computability and recursion theory
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 13 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
