There are no minimal essentially undecidable theories

We show that there is no theory that is minimal with respect to interpretability among recursively enumerable essentially undecidable theories.

Automated summary

We prove that there is no theory in the class of recursively enumerable essentially undecidable theories that is minimal in terms of interpretability.