2022/02/22 by Camrud, Caleb
#03B52 #03C57 #03D45 #03D78 #FOS: Mathematics #Logic (math.LO)
paper · doi:10.48550/arxiv.2202.11151
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.