论文标题
连续逻辑的一般有效完整性
Generalized effective completeness for continuous logic
论文作者
论文摘要
在本文中，我们提出了一个通用的有效完整定理，用于连续逻辑。主要结果是，任何连续理论都可以在接受相同图灵程度的呈现的结构中满足。然后得出结论，任何可决定的理论都可以通过可计算的可计算结构来满足。这修改并扩展了先前的部分有效完整定理，以供卡尔弗特（Calvert）和迪德瓦尔（Didehvar），ghasemloo和pourmahdian提供的连续逻辑。
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.
