Is there a first-order theory who does not interpret arithmetic yet still does not have a computable consistent completion? By not interpreting arithmetic, I mean it does not interprets enough arithmetic for Godel's argument (coding the syntax, finding the fix point) to work through. In other words, is there any other methods to prove that a theory does not have a computable consistent complete extension, or can we prove the converse that every such theory interprets arithmetic?
Related, is there a class of structures whose first-order theory is not computable and arithmetic is not interpreted in it?
 A: Another example is the theory $\text{Th}(\mathcal{P}(\mathbb{R}),\subset,<)$ of subsets of the reals, where $S$ is less than $S'$ iff every element of $S$ is less than every element of $S'$.
The theory is consistent and complete by definition. Shelah proved that it is not decidable, which means it also has no decidable extension, and Gurevich and Shelah jointly proved that it does not interpret arithmetic.
To be more precise, Gurevich and Shelah work with a variant of the theory where $<$ applies only to singletons, and they prove that it does not interpret even the weak set theory of null set, singleton and union:
\begin{align}
\exists y \forall z &[z \notin y]\\
\forall x \exists y \forall z &[z \in y\leftrightarrow z=x]\\
\forall w \forall x \exists y \forall z &[z \in y\leftrightarrow z \in w \text{ or } z \in x]\\
\end{align}
The two results on undecidability and non-interpretability are both difficult, but these questions of mine have more details.
A: Any theory that can represent all recursive functions has no consistent decidable extension, however there are such theories that do not interpret even as weak an arithmetic as Robinson’s theory $R$, see my paper Recursive functions and existentially closed structures (arXiv:1710.09864 [math.LO], to appear in Journal of Mathematical Logic).
You don’t even need to represent all recursive functions. Fix a recursively inseparable pair of r.e. predicates $A,B\subseteq\mathbb N$. Let $L$ be the language consisting of one unary predicate $P$, and constants $\overline n$ for every $n\in\mathbb N$, and let $T$ be the (recursively axiomatizable) theory axiomatized by $P(\overline n)$ for $n\in A$, and $\neg P(\overline n)$ for $n\in B$. Then $T$ has no decidable consistent extension, and it does not interpret much of anything (in particular, if $S$ is a theory in a finite language interpretable in $T$, then $S$ is also interpretable in a finite-language fragment of $T$, and as such does have a decidable extension).
