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

IF 0.3 Q4 LOGIC Journal of Logic and Analysis Pub Date : 2023-09-25 DOI:10.4115/jla.2023.15.4
Caleb Camrud
{"title":"连续逻辑的广义有效完备性","authors":"Caleb Camrud","doi":"10.4115/jla.2023.15.4","DOIUrl":null,"url":null,"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.","PeriodicalId":53872,"journal":{"name":"Journal of Logic and Analysis","volume":null,"pages":null},"PeriodicalIF":0.3000,"publicationDate":"2023-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Generalized effective completeness for continuous logic\",\"authors\":\"Caleb Camrud\",\"doi\":\"10.4115/jla.2023.15.4\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":53872,\"journal\":{\"name\":\"Journal of Logic and Analysis\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.3000,\"publicationDate\":\"2023-09-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Logic and Analysis\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4115/jla.2023.15.4\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"LOGIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Logic and Analysis","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4115/jla.2023.15.4","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"LOGIC","Score":null,"Total":0}
引用次数: 0

摘要

本文给出了连续逻辑的一个广义有效完备定理。主要结果是,任何连续理论都满足于一个结构,它允许相同的图灵度的表示。由此可见,任何可确定的理论都满足于一个可计算的可呈现的结构。修正和推广了先前由Calvert和Didehvar、Ghasemloo和Pourmahdian给出的连续逻辑的部分有效完备性定理。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Generalized effective completeness for continuous logic
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
0.80
自引率
0.00%
发文量
2
审稿时长
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.
期刊最新文献
Fractals and the monadic second order theory of one successor A computational study of a class of recursive inequalities Generalized effective completeness for continuous logic Polish topologies on groups of non-singular transformations Compactness of $\omega^\lambda$ for $\lambda$ singular
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1