论子残差网格的子残差和一些相关逻辑

IF 0.7 4区 数学 Q3 COMPUTER SCIENCE, THEORY & METHODS Journal of Logic and Computation Pub Date : 2024-07-23 DOI:10.1093/logcom/exad042
JosÉ Luis Castiglioni, Víctor FernÁndez, Héctor Federico Mallea, HernÁn Javier San MartÍn
{"title":"论子残差网格的子残差和一些相关逻辑","authors":"JosÉ Luis Castiglioni, Víctor FernÁndez, Héctor Federico Mallea, HernÁn Javier San MartÍn","doi":"10.1093/logcom/exad042","DOIUrl":null,"url":null,"abstract":"Subresiduated lattices were introduced during the decade of 1970 by Epstein and Horn as an algebraic counterpart of some logics with strong implication previously studied by Lewy and Hacking. These logics are examples of subintuitionistic logics, i.e. logics in the language of intuitionistic logic that are defined semantically by using Kripke models, in the same way as intuitionistic logic is defined, but without requiring of the models some of the properties required in the intuitionistic case. Also in relation with the study of subintuitionistic logics, Celani and Jansana get these algebras as the elements of a subvariety of that of weak Heyting algebras. Here, we study both the implicative and the implicative-infimum subreducts of subresiduated lattices. Besides, we propose a calculus whose equivalent algebraic semantics is given by these classes of algebras. Several expansions of these calculi are also studied together with some interesting properties of them.","PeriodicalId":50162,"journal":{"name":"Journal of Logic and Computation","volume":"167 1","pages":""},"PeriodicalIF":0.7000,"publicationDate":"2024-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On subreducts of subresiduated lattices and some related logics\",\"authors\":\"JosÉ Luis Castiglioni, Víctor FernÁndez, Héctor Federico Mallea, HernÁn Javier San MartÍn\",\"doi\":\"10.1093/logcom/exad042\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Subresiduated lattices were introduced during the decade of 1970 by Epstein and Horn as an algebraic counterpart of some logics with strong implication previously studied by Lewy and Hacking. These logics are examples of subintuitionistic logics, i.e. logics in the language of intuitionistic logic that are defined semantically by using Kripke models, in the same way as intuitionistic logic is defined, but without requiring of the models some of the properties required in the intuitionistic case. Also in relation with the study of subintuitionistic logics, Celani and Jansana get these algebras as the elements of a subvariety of that of weak Heyting algebras. Here, we study both the implicative and the implicative-infimum subreducts of subresiduated lattices. Besides, we propose a calculus whose equivalent algebraic semantics is given by these classes of algebras. Several expansions of these calculi are also studied together with some interesting properties of them.\",\"PeriodicalId\":50162,\"journal\":{\"name\":\"Journal of Logic and Computation\",\"volume\":\"167 1\",\"pages\":\"\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2024-07-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Logic and Computation\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1093/logcom/exad042\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Logic and Computation","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1093/logcom/exad042","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

亚残差格是爱泼斯坦和霍恩在 1970 年的十年间提出的,作为路易和哈金之前研究的一些强蕴涵逻辑的代数对应物。这些逻辑是亚直观逻辑的例子,即直观逻辑语言中的逻辑,它们通过使用克里普克模型进行语义定义,与直观逻辑的定义方式相同,但不要求模型具有直观逻辑所要求的某些性质。同样是关于亚直观逻辑的研究,塞拉尼和扬萨纳把这些代数当作弱海廷代数的一个子品种的元素。在这里,我们研究了亚残差格的蕴涵和蕴涵-最小子归结。此外,我们还提出了一种微积分,它的等价代数语义是由这些代数给出的。我们还研究了这些计算的若干扩展及其一些有趣的性质。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
On subreducts of subresiduated lattices and some related logics
Subresiduated lattices were introduced during the decade of 1970 by Epstein and Horn as an algebraic counterpart of some logics with strong implication previously studied by Lewy and Hacking. These logics are examples of subintuitionistic logics, i.e. logics in the language of intuitionistic logic that are defined semantically by using Kripke models, in the same way as intuitionistic logic is defined, but without requiring of the models some of the properties required in the intuitionistic case. Also in relation with the study of subintuitionistic logics, Celani and Jansana get these algebras as the elements of a subvariety of that of weak Heyting algebras. Here, we study both the implicative and the implicative-infimum subreducts of subresiduated lattices. Besides, we propose a calculus whose equivalent algebraic semantics is given by these classes of algebras. Several expansions of these calculi are also studied together with some interesting properties of them.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Logic and Computation
Journal of Logic and Computation 工程技术-计算机:理论方法
CiteScore
1.90
自引率
14.30%
发文量
82
审稿时长
6-12 weeks
期刊介绍: Logic has found application in virtually all aspects of Information Technology, from software engineering and hardware to programming and artificial intelligence. Indeed, logic, artificial intelligence and theoretical computing are influencing each other to the extent that a new interdisciplinary area of Logic and Computation is emerging. The Journal of Logic and Computation aims to promote the growth of logic and computing, including, among others, the following areas of interest: Logical Systems, such as classical and non-classical logic, constructive logic, categorical logic, modal logic, type theory, feasible maths.... Logical issues in logic programming, knowledge-based systems and automated reasoning; logical issues in knowledge representation, such as non-monotonic reasoning and systems of knowledge and belief; logics and semantics of programming; specification and verification of programs and systems; applications of logic in hardware and VLSI, natural language, concurrent computation, planning, and databases. The bulk of the content is technical scientific papers, although letters, reviews, and discussions, as well as relevant conference reviews, are included.
期刊最新文献
ASPECT: Answer Set rePresentation as vEctor graphiCs in laTex Modal weak Kleene logics: axiomatizations and relational semantics A Gödel-Dugundji-style theorem for the minimal structural logic Perfect proofs at first order Intuitionistic S4 as a logic of topological spaces
×
引用
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