Maximal Hyperclones Determined by Monotone Operations

Jelena Colic, Hajime Machida, J. Pantović
{"title":"Maximal Hyperclones Determined by Monotone Operations","authors":"Jelena Colic, Hajime Machida, J. Pantović","doi":"10.1109/ISMVL.2011.46","DOIUrl":null,"url":null,"abstract":"Let A be a finite set. It is well known that every bounded partial order relation determines a maximal clone on A and every non-trivial partial order relation determines a maximal partial clone on A. In this paper we describe a class of maximal hyper clones that are determined by bounded partial order relations on A.","PeriodicalId":234611,"journal":{"name":"2011 41st IEEE International Symposium on Multiple-Valued Logic","volume":"2 4","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","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.46","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Let A be a finite set. It is well known that every bounded partial order relation determines a maximal clone on A and every non-trivial partial order relation determines a maximal partial clone on A. In this paper we describe a class of maximal hyper clones that are determined by bounded partial order relations on A.
由单调运算确定的最大超克隆
设A是一个有限集合。众所周知,每一个有界偏序关系决定了a上的一个极大克隆,每一个非平凡偏序关系决定了a上的一个极大偏克隆。本文描述了由a上的有界偏序关系决定的一类极大超克隆。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信