The complexity of classifying continuous t-norms up to isomorphism

Jialiang He, Lili Shen, Yi Zhou
{"title":"The complexity of classifying continuous t-norms up to isomorphism","authors":"Jialiang He, Lili Shen, Yi Zhou","doi":"arxiv-2408.16456","DOIUrl":null,"url":null,"abstract":"It is shown that the isomorphism relation between continuous t-norms is Borel\nbireducible with the relation of order isomorphism between linear orders on the\nset of natural numbers, and therefore, it is Borel bireducible with every Borel\ncomplete equivalence relation.","PeriodicalId":501306,"journal":{"name":"arXiv - MATH - Logic","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - MATH - Logic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2408.16456","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

It is shown that the isomorphism relation between continuous t-norms is Borel bireducible with the relation of order isomorphism between linear orders on the set of natural numbers, and therefore, it is Borel bireducible with every Borel complete equivalence relation.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
直到同构为止的连续 t-norms 分类的复杂性
结果表明,连续 t-norms 之间的同构关系与自然数集上线性阶之间的阶同构关系是伯尔双向可简化关系,因此,它与每个伯尔完全等价关系都是伯尔双向可简化关系。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Denotational semantics driven simplicial homology? AC and the Independence of WO in Second-Order Henkin Logic, Part II Positively closed parametrized models Neostability transfers in derivation-like theories Tameness Properties in Multiplicative Valued Difference Fields with Lift and Section
×
引用
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