Decidability bounds for Presburger arithmetic extended by sine

IF 0.6 2区 数学 Q2 LOGIC Annals of Pure and Applied Logic Pub Date : 2024-06-12 DOI:10.1016/j.apal.2024.103487
{"title":"Decidability bounds for Presburger arithmetic extended by sine","authors":"","doi":"10.1016/j.apal.2024.103487","DOIUrl":null,"url":null,"abstract":"<div><p>We consider Presburger arithmetic extended by the sine function, call this extension sine-Presburger arithmetic (<strong>sin-PA</strong>), and systematically study decision problems for sets of sentences in <strong>sin-PA</strong>. In particular, we detail a decision algorithm for existential sin-PA sentences under assumption of Schanuel's conjecture. This procedure reduces decisions to the theory of the ordered additive group of real numbers extended by sine, which is decidable under Schanuel's conjecture. On the other hand, we prove that four alternating quantifier blocks suffice for undecidability of sin-PA sentences. To do so, we explicitly interpret the weak monadic second-order theory of the grid, which is undecidable, in <strong>sin-PA</strong>.</p></div>","PeriodicalId":50762,"journal":{"name":"Annals of Pure and Applied Logic","volume":"175 10","pages":"Article 103487"},"PeriodicalIF":0.6000,"publicationDate":"2024-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0168007224000915/pdfft?md5=8ec66c0193137f3b2153f14d4d1e4bed&pid=1-s2.0-S0168007224000915-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Pure and Applied Logic","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0168007224000915","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"LOGIC","Score":null,"Total":0}
引用次数: 0

Abstract

We consider Presburger arithmetic extended by the sine function, call this extension sine-Presburger arithmetic (sin-PA), and systematically study decision problems for sets of sentences in sin-PA. In particular, we detail a decision algorithm for existential sin-PA sentences under assumption of Schanuel's conjecture. This procedure reduces decisions to the theory of the ordered additive group of real numbers extended by sine, which is decidable under Schanuel's conjecture. On the other hand, we prove that four alternating quantifier blocks suffice for undecidability of sin-PA sentences. To do so, we explicitly interpret the weak monadic second-order theory of the grid, which is undecidable, in sin-PA.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
由正弦扩展的普雷斯伯格算术的可判定性边界
我们考虑了由正弦函数扩展的普雷斯伯格算术,称这种扩展为正弦-普雷斯伯格算术(),并系统地研究了.PA 中句子集的判定问题。 特别是,我们详细介绍了在沙努埃尔猜想的假设下存在的正弦-PA 句子的判定算法。这一过程将判定问题简化为由正弦扩展的实数有序加法群理论,而该理论在沙努埃尔猜想下是可判定的。另一方面,我们证明了四个交替量词块足以导致 sin-PA 句子的不可判定性。为此,我们明确地解释了网格的弱一元二阶理论,该理论在.NET 中是不可判定的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
1.40
自引率
12.50%
发文量
78
审稿时长
200 days
期刊介绍: The journal Annals of Pure and Applied Logic publishes high quality papers in all areas of mathematical logic as well as applications of logic in mathematics, in theoretical computer science and in other related disciplines. All submissions to the journal should be mathematically correct, well written (preferably in English)and contain relevant new results that are of significant interest to a substantial number of logicians. The journal also considers submissions that are somewhat too long to be published by other journals while being too short to form a separate memoir provided that they are of particular outstanding quality and broad interest. In addition, Annals of Pure and Applied Logic occasionally publishes special issues of selected papers from well-chosen conferences in pure and applied logic.
期刊最新文献
Universal proof theory: Feasible admissibility in intuitionistic modal logics Bi-colored expansions of geometric theories Equiconsistency of the Minimalist Foundation with its classical version Some properties of precompletely and positively numbered sets Strong reducibilities and set theory
×
引用
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