# Model completeness and relative decidability

## TL;DR

This paper explores how model completeness of a theory influences the decidability of models' elementary diagrams, establishing a characterization of model completeness via uniform procedures for deciding these diagrams.

## Contribution

It proves that a c.e. theory is model complete if and only if there is a uniform procedure to decide elementary diagrams from atomic diagrams across all models.

## Key findings

- A computable model of a model complete theory has a decidable elementary diagram.
- A c.e. theory is model complete iff elementary diagrams are uniformly decidable from atomic diagrams.
- Uniform procedures exist for deciding diagrams across all models of a theory under certain conditions.

## Abstract

We study the implications of model completeness of a theory for the effectiveness of presentations of models of that theory. It is immediate that for a computable model $\mathcal A$ of a computably enumerable, model complete theory, the entire elementary diagram $E(\mathcal A)$ must be decidable. We prove that indeed a c.e. theory $T$ is model complete if and only if there is a uniform procedure that succeeds in deciding $E(\mathcal A)$ from the atomic diagram $\Delta(\mathcal A)$ for all countable models $\mathcal A$ of $T$. Moreover, if every presentation of a single isomorphism type $\mathcal A$ has this property of relative decidability, then there must be a procedure with succeeds uniformly for all presentations of an expansion $(\mathcal A,\vec{a})$ by finitely many new constants. We end with a conjecture about the situation when all models of a theory are relatively decidable.