Algebraic characterizations and block product decompositions for first order logic and its infinitary quantifier extensions over countable words

IF 1.1 3区 计算机科学 Q1 BUSINESS, FINANCE Journal of Computer and System Sciences Pub Date : 2023-09-01 DOI:10.1016/j.jcss.2023.04.002
Bharat Adsul , Saptarshi Sarkar , A.V. Sreejith
{"title":"Algebraic characterizations and block product decompositions for first order logic and its infinitary quantifier extensions over countable words","authors":"Bharat Adsul ,&nbsp;Saptarshi Sarkar ,&nbsp;A.V. Sreejith","doi":"10.1016/j.jcss.2023.04.002","DOIUrl":null,"url":null,"abstract":"<div><p>We contribute to the refined understanding of language-logic-algebra interplay in a recent algebraic framework over countable words. Algebraic characterizations of the one variable fragment of FO as well as the boolean closure of the existential fragment of FO are established. We develop a seamless integration of the block product operation in the countable setting, and generalize well-known decompositional characterizations of FO and its two variable fragment. We propose an extension of FO admitting infinitary quantifiers to reason about inherent infinitary properties of countable words, and obtain a natural hierarchical block-product based characterization of this extension. Properties expressible in this extension can be simultaneously expressed in the classical logical systems such as WMSO and FO[cut]. We also rule out the possibility of a finite-basis for a block-product based characterization of these logical systems. Finally, we report algebraic characterizations of one variable fragments of the hierarchies of the new extension.</p></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"136 ","pages":"Pages 302-326"},"PeriodicalIF":1.1000,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computer and System Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0022000023000405","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"BUSINESS, FINANCE","Score":null,"Total":0}
引用次数: 0

Abstract

We contribute to the refined understanding of language-logic-algebra interplay in a recent algebraic framework over countable words. Algebraic characterizations of the one variable fragment of FO as well as the boolean closure of the existential fragment of FO are established. We develop a seamless integration of the block product operation in the countable setting, and generalize well-known decompositional characterizations of FO and its two variable fragment. We propose an extension of FO admitting infinitary quantifiers to reason about inherent infinitary properties of countable words, and obtain a natural hierarchical block-product based characterization of this extension. Properties expressible in this extension can be simultaneously expressed in the classical logical systems such as WMSO and FO[cut]. We also rule out the possibility of a finite-basis for a block-product based characterization of these logical systems. Finally, we report algebraic characterizations of one variable fragments of the hierarchies of the new extension.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一阶逻辑的代数表征和块积分解及其可数词上的无限量词扩展
在最近关于可数词的代数框架中,我们有助于对语言逻辑代数相互作用的精细理解。建立了FO的单变量片段的代数刻画以及FO存在片段的布尔闭包。我们在可数设置下开发了块积运算的无缝集成,并推广了FO及其双变量片段的众所周知的分解特征。我们提出了FO允许不定式量词的扩展,以推理可数词的固有不定式性质,并获得了该扩展的基于自然层次块积的特征。在这个扩展中可表达的属性可以同时在经典逻辑系统中表达,如WMSO和FO[cut]。我们还排除了这些逻辑系统的基于块积的特征化的有限基的可能性。最后,我们报告了新扩展的层次结构的一个变量片段的代数特征。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Journal of Computer and System Sciences
Journal of Computer and System Sciences 工程技术-计算机:理论方法
CiteScore
3.70
自引率
0.00%
发文量
58
审稿时长
68 days
期刊介绍: The Journal of Computer and System Sciences publishes original research papers in computer science and related subjects in system science, with attention to the relevant mathematical theory. Applications-oriented papers may also be accepted and they are expected to contain deep analytic evaluation of the proposed solutions. Research areas include traditional subjects such as: • Theory of algorithms and computability • Formal languages • Automata theory Contemporary subjects such as: • Complexity theory • Algorithmic Complexity • Parallel & distributed computing • Computer networks • Neural networks • Computational learning theory • Database theory & practice • Computer modeling of complex systems • Security and Privacy.
期刊最新文献
Time-sharing scheduling with tolerance capacities Embedding hypercubes into torus and Cartesian product of paths and/or cycles for minimizing wirelength The parameterized complexity of the survivable network design problem Monitoring the edges of product networks using distances Algorithms and Turing kernels for detecting and counting small patterns in unit disk graphs
×
引用
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