It is well-known that the theory of the structure $(\mathbb{N},<)$ is not stable, but is NIP and has quantifier elimination in the language $L=\{<,0,S,S^{-1}\}$ where $S,S^{-1}$ are function symbols represented as the successor and predecessor functions, respectively.
Consider now an irrational number $\alpha\in (0,1)$ and the function $f:\mathbb{N}\to\mathbb{N}$ interpreted as $f(x)=\lfloor \alpha\cdot x\rfloor$ (the integer part of $\alpha\cdot x$).
Questions:
- Is there any natural language on which the theory $\operatorname{Th}(\mathbb{N},<,f)$ has quantifier elimination?
- Is the theory $\operatorname{Th}(\mathbb{N},<,f)$ still NIP?