Generalized effective completeness for continuous logic
Logic
2022-02-24 v1
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.
Cite
@article{arxiv.2202.11151,
title = {Generalized effective completeness for continuous logic},
author = {Caleb Camrud},
journal= {arXiv preprint arXiv:2202.11151},
year = {2022}
}