Characterizing relative decidability in terms of model completeness
Matthew Harrison-Trainor, Liam Tan

TL;DR
This paper characterizes when a complete theory is relatively decidable by linking it to conservative model complete extensions, confirming a conjecture and highlighting differences with incomplete theories.
Contribution
It proves a conjecture relating relative decidability to conservative model complete extensions for complete theories, and shows the characterization fails for incomplete theories.
Findings
Complete theories are relatively decidable iff they have a conservative model complete extension of a specific form.
The conjecture by Chubb, Miller, and Solomon is verified for complete theories.
No similar characterization applies to incomplete theories.
Abstract
A theory is said to be relatively decidable if for every model of , one can compute the elementary diagram of that model from its atomic diagram together with . We verify a conjecture of Chubb, Miller, and Solomon by showing that for complete theories , is relatively decidable if and only if has a conservative model complete extension of the form where . We also show that no such characterization works for incomplete theories.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
