Choice-Free Dualities for Lattice Expansions: Application to Logics with a Negation Operator

Pub Date : 2024-07-23 DOI:10.1007/s11225-024-10131-3
Chrysafis Hartonas
{"title":"Choice-Free Dualities for Lattice Expansions: Application to Logics with a Negation Operator","authors":"Chrysafis Hartonas","doi":"10.1007/s11225-024-10131-3","DOIUrl":null,"url":null,"abstract":"<p>Constructive dualities have recently been proposed for some lattice-based algebras and a related project has been outlined by Holliday and Bezhanishvili, aiming at obtaining “choice-free spatial dualities for other classes of algebras [<span>\\(\\ldots \\)</span>], giving rise to choice-free completeness proofs for non-classical logics”. We present in this article a way to complete the Holliday–Bezhanishvili project (uniformly, for any normal lattice expansion). This is done by recasting in a choice-free manner recent relational representation and duality results by the author. These results addressed the general representation and duality problem for lattices with quasi-operators, extending the Jónsson–Tarski approach for BAOs, and Dunn’s follow-up approach for distributive generalized Galois logics, to contexts where distributivity may not be assumed. To illustrate, we apply the framework to lattices (and their logics) with some form or other of a (quasi)complementation operator, obtaining correspondence results and canonical extensions in relational frames and choice-free dualities for lattices with a minimal, or a Galois quasi-complement, or involutive lattices, including De Morgan algebras, as well as Ortholattices and Boolean algebras, as special cases.</p>","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s11225-024-10131-3","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Constructive dualities have recently been proposed for some lattice-based algebras and a related project has been outlined by Holliday and Bezhanishvili, aiming at obtaining “choice-free spatial dualities for other classes of algebras [\(\ldots \)], giving rise to choice-free completeness proofs for non-classical logics”. We present in this article a way to complete the Holliday–Bezhanishvili project (uniformly, for any normal lattice expansion). This is done by recasting in a choice-free manner recent relational representation and duality results by the author. These results addressed the general representation and duality problem for lattices with quasi-operators, extending the Jónsson–Tarski approach for BAOs, and Dunn’s follow-up approach for distributive generalized Galois logics, to contexts where distributivity may not be assumed. To illustrate, we apply the framework to lattices (and their logics) with some form or other of a (quasi)complementation operator, obtaining correspondence results and canonical extensions in relational frames and choice-free dualities for lattices with a minimal, or a Galois quasi-complement, or involutive lattices, including De Morgan algebras, as well as Ortholattices and Boolean algebras, as special cases.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
网格展开的无选择二元性:带否定操作符的逻辑应用
霍利迪和贝扎尼什维利提出了一个相关的项目,旨在获得 "其他类代数[\(\ldots \)]的无选择空间对偶性,为非经典逻辑提供无选择完备性证明"。我们在本文中提出了一种完成霍利迪-贝扎尼什维利项目的方法(统一地,对于任何正常晶格展开)。这是通过以一种无选择的方式重铸作者最近的关系表示和对偶性结果来实现的。这些结果解决了具有准运算符的网格的一般表示和对偶性问题,将琼森-塔尔斯基(Jónsson-Tarski)的 BAO 方法和邓恩(Dunn)的分布式广义伽罗瓦逻辑的后续方法扩展到了可以不假定分布性的上下文中。为了说明这一点,我们把这个框架应用于具有某种形式的(准)互补算子的网格(及其逻辑),为具有最小或伽罗瓦准互补的网格,或包括德摩根代数在内的渐开线网格,以及作为特例的正交网格和布尔代数,在关系框架和无选择对偶性中获得了对应结果和规范扩展。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
×
引用
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