Generalized effective completeness for continuous logic

IF 0.3 Q4 LOGIC

Journal of Logic and Analysis Pub Date : 2023-09-25 DOI:10.4115/jla.2023.15.4

Caleb Camrud

引用次数: 0

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.

查看原文本刊更多论文

连续逻辑的广义有效完备性

本文给出了连续逻辑的一个广义有效完备定理。主要结果是，任何连续理论都满足于一个结构，它允许相同的图灵度的表示。由此可见，任何可确定的理论都满足于一个可计算的可呈现的结构。修正和推广了先前由Calvert和Didehvar、Ghasemloo和Pourmahdian给出的连续逻辑的部分有效完备性定理。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Journal of Logic and Analysis LOGIC-

CiteScore

0.80

自引率

0.00%

发文量

审稿时长

35 weeks

期刊介绍： "Journal of Logic and Analysis" publishes papers of high quality involving interaction between ideas or techniques from mathematical logic and other areas of mathematics (especially - but not limited to - pure and applied analysis). The journal welcomes papers in nonstandard analysis and related areas of applied model theory; papers involving interplay between mathematics and logic (including foundational aspects of such interplay); mathematical papers using or developing analytical methods having connections to any area of mathematical logic. "Journal of Logic and Analysis" is intended to be a natural home for papers with an essential interaction between mathematical logic and other areas of mathematics, rather than for papers purely in logic or analysis.