Generalized effective completeness for continuous logic

Caleb Camrud


In this paper, we present a generalized effective completeness theorem for continuous logic. The primary result is that any continuous theory is satisfied in a structure which admits a presentation of the same Turing degree. It then follows that any decidable theory is satisfied by a computably presentable structure. This modifies and extends previous partial effective completeness theorems for continuous logic given by Calvert and Didehvar, Ghasemloo, and Pourmahdian.


Effective completeness; Continuous logic; Metric structures; Computable presentations

Full Text:

4. [PDF]


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.

Journal of Logic and Analysis ISSN:  1759-9008