Generalized effective completeness for continuous logic

From MaRDI portal
Publication:6091635



Abstract: 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.













This page was built for publication: Generalized effective completeness for continuous logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6091635)