Weak Uninorm Based Logic and Its Filter Theory

M. Kondo, M. Kawaguchi, M. Miyakoshi, O. Watari
{"title":"Weak Uninorm Based Logic and Its Filter Theory","authors":"M. Kondo, M. Kawaguchi, M. Miyakoshi, O. Watari","doi":"10.1109/ISMVL.2011.60","DOIUrl":null,"url":null,"abstract":"We give an axiomatic system of a logic called here a weak uninorm based logic (wUL), which is proved to be characterized by the class of all (not necessary bounded nor integral) commutative residuated lattices. We see that the logic is algebraizable. Since many well-known logics, e.g., UBL by Watari and al., UL by Metcalfe and Montanga, ML by H\\\"ohle, MTL by Esteva and L. Godo, BL by H\\'ajek, and so on, are axiomatic extensions of our logic, those logics are all algebraizable. Moreover we define filters of commutative residuated lattices $X$ and show that the class of all filters of $X$ is isomorphic to the class $Con(X)$ of all congruences on $X$. At last, as an application of our characterization of wUL, we give a negative answer to the problem that \"Is UBL characterized by the class of linearly ordered UBL-algebras?\", which was left open in [10].","PeriodicalId":234611,"journal":{"name":"2011 41st IEEE International Symposium on Multiple-Valued Logic","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 41st IEEE International Symposium on Multiple-Valued Logic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISMVL.2011.60","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

We give an axiomatic system of a logic called here a weak uninorm based logic (wUL), which is proved to be characterized by the class of all (not necessary bounded nor integral) commutative residuated lattices. We see that the logic is algebraizable. Since many well-known logics, e.g., UBL by Watari and al., UL by Metcalfe and Montanga, ML by H\"ohle, MTL by Esteva and L. Godo, BL by H\'ajek, and so on, are axiomatic extensions of our logic, those logics are all algebraizable. Moreover we define filters of commutative residuated lattices $X$ and show that the class of all filters of $X$ is isomorphic to the class $Con(X)$ of all congruences on $X$. At last, as an application of our characterization of wUL, we give a negative answer to the problem that "Is UBL characterized by the class of linearly ordered UBL-algebras?", which was left open in [10].
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于弱一致的逻辑及其滤波理论
本文给出了一个逻辑的公理化系统,称为弱一致基逻辑(wUL),并证明了它的特征为一类所有(不必要有界的或积分的)交换剩余格。我们看到逻辑是可代数的。由于许多众所周知的逻辑,如Watari等人的UBL, Metcalfe和Montanga的UL, H\ ohle的ML, Esteva和L. Godo的MTL, H\ ajek的BL,等等,都是我们逻辑的公理化扩展,这些逻辑都是可代数的。此外,我们定义了交换剩余格$X$的滤波器,并证明了$X$上所有滤波器的类同构于$X$上所有同余的类$Con(X)$。最后,作为我们对wUL表征的一个应用,我们对文献[10]中留下的问题“UBL是否由线性有序的UBL-代数类来表征?”给出了否定的答案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Improved Complexity of Quantum Oracles for Ternary Grover Algorithm for Graph Coloring Invitation to Clone Theory with Partial Clones and Hyperclones From Truth Tables to Programming Languages: Progress in the Design of Reversible Circuits A Graph-Based Approach to Designing Multiple-Valued Arithmetic Algorithms The Lattice of the Clones of Self-Dual Functions in Three-Valued Logic
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1