The first-order theory of binary overlap-free words is decidable

Luke Schaeffer, Jeffrey Shallit
{"title":"The first-order theory of binary overlap-free words is decidable","authors":"Luke Schaeffer, Jeffrey Shallit","doi":"10.4153/s0008414x23000342","DOIUrl":null,"url":null,"abstract":"Abstract We show that the first-order logical theory of the binary overlap-free words (and, more generally, the $\\alpha $ -free words for rational $\\alpha $ , $2 < \\alpha \\leq 7/3$ ), is decidable. As a consequence, many results previously obtained about this class through tedious case-based proofs can now be proved “automatically,” using a decision procedure, and new claims can be proved or disproved simply by restating them as logical formulas.","PeriodicalId":55284,"journal":{"name":"Canadian Journal of Mathematics-Journal Canadien De Mathematiques","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2023-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Canadian Journal of Mathematics-Journal Canadien De Mathematiques","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4153/s0008414x23000342","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

Abstract We show that the first-order logical theory of the binary overlap-free words (and, more generally, the $\alpha $ -free words for rational $\alpha $ , $2 < \alpha \leq 7/3$ ), is decidable. As a consequence, many results previously obtained about this class through tedious case-based proofs can now be proved “automatically,” using a decision procedure, and new claims can be proved or disproved simply by restating them as logical formulas.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
二元无重叠词的一阶理论是可判定的
摘要我们证明了二元无重叠词(更一般地说,对于有理的$\alpha $自由词$\alpha $, $2 < \alpha \leq 7/3$)的一阶逻辑理论是可判定的。因此,以前通过冗长的基于案例的证明获得的关于这类的许多结果现在可以使用决策过程“自动”证明,并且可以简单地通过将新的主张重述为逻辑公式来证明或证伪它们。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
1.80
自引率
0.00%
发文量
58
审稿时长
4.5 months
期刊介绍: The Canadian Journal of Mathematics (CJM) publishes original, high-quality research papers in all branches of mathematics. The Journal is a flagship publication of the Canadian Mathematical Society and has been published continuously since 1949. New research papers are published continuously online and collated into print issues six times each year. To be submitted to the Journal, papers should be at least 18 pages long and may be written in English or in French. Shorter papers should be submitted to the Canadian Mathematical Bulletin. Le Journal canadien de mathématiques (JCM) publie des articles de recherche innovants de grande qualité dans toutes les branches des mathématiques. Publication phare de la Société mathématique du Canada, il est publié en continu depuis 1949. En ligne, la revue propose constamment de nouveaux articles de recherche, puis les réunit dans des numéros imprimés six fois par année. Les textes présentés au JCM doivent compter au moins 18 pages et être rédigés en anglais ou en français. C’est le Bulletin canadien de mathématiques qui reçoit les articles plus courts.
期刊最新文献
Tangle Equations, the Jones conjecture, slopes of surfaces in tangle complements, and q-deformed rationals COMPACTIFICATIONS OF MODULI OF DEL PEZZO SURFACES VIA LINE ARRANGEMENT AND K-STABILITY The blowup-polynomial of a metric space: connections to stable polynomials, graphs and their distance spectra A NEW WAY TO TACKLE A CONJECTURE OF RÉMOND PRIME REPRESENTATIONS IN THE HERNANDEZ-LECLERC CATEGORY: CLASSICAL DECOMPOSITIONS
×
引用
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