On some Sufficient Condition for the Equality of Multi-clone and Super-clone

N. A. Peryazev, I. K. Sharankhaev, Николай Алексеевич Перязев, Иван Константинович Шаранхаев
{"title":"On some Sufficient Condition for the Equality of Multi-clone and Super-clone","authors":"N. A. Peryazev, I. K. Sharankhaev, Николай Алексеевич Перязев, Иван Константинович Шаранхаев","doi":"10.17516/1997-1397-2018-11-1-97-102","DOIUrl":null,"url":null,"abstract":"Clones are studied most actively in the theory of functional systems [1]. Clones are sets of operations that are closed with respect to superposition, and they contain all projection operators. Recently interest in generalizations of clones, namely, hyperclones, multiclones and superclones has been raised [2]. Multi-clone is a set of multi-operations which are closed with respect to superposition, and it contains all complete, empty and projection operations. A super-clone is obtained from a multi-clone by adding the closure condition with respect to solvability of the simplest equation. It is known that super-clones are closely related to clones. Complete Galois connection between them was established [3]. Condition of the equality of multi-clone and super-clone is obtained in this paper. Let A be an arbitrary finite set, and B(A) be the set of all subsets of A including ∅. A mapping from A into A is described as an n-ary operation on A (the case n = 0 is possible). The set of all n-ary operations on A is described as P A, and the set of all operations on A is described as PA = ∪","PeriodicalId":422202,"journal":{"name":"Journal of Siberian Federal University. Mathematics and Physics","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Siberian Federal University. Mathematics and Physics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.17516/1997-1397-2018-11-1-97-102","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Clones are studied most actively in the theory of functional systems [1]. Clones are sets of operations that are closed with respect to superposition, and they contain all projection operators. Recently interest in generalizations of clones, namely, hyperclones, multiclones and superclones has been raised [2]. Multi-clone is a set of multi-operations which are closed with respect to superposition, and it contains all complete, empty and projection operations. A super-clone is obtained from a multi-clone by adding the closure condition with respect to solvability of the simplest equation. It is known that super-clones are closely related to clones. Complete Galois connection between them was established [3]. Condition of the equality of multi-clone and super-clone is obtained in this paper. Let A be an arbitrary finite set, and B(A) be the set of all subsets of A including ∅. A mapping from A into A is described as an n-ary operation on A (the case n = 0 is possible). The set of all n-ary operations on A is described as P A, and the set of all operations on A is described as PA = ∪
多克隆和超克隆相等的几个充分条件
在功能系统理论中,克隆的研究最为活跃[1]。克隆是相对于叠加闭合的操作集合,它们包含所有的投影算子。最近对克隆的概括,即超克隆、多克隆和超克隆的兴趣已经提高[2]。多克隆是一组相对于叠加闭合的多操作的集合,它包含了所有的完全、空和投影操作。通过对最简单方程的可解性加上闭包条件,得到了一个超级克隆。众所周知,超级克隆与克隆密切相关。它们之间建立了完全的伽罗瓦连接[3]。本文给出了多克隆和超克隆相等的条件。设A为任意有限集合,B(A)为A包含∅的所有子集的集合。从A到A的映射被描述为对A的n元操作(n = 0是可能的情况)。对A的所有n元操作的集合被描述为PA,对A的所有操作的集合被描述为PA =∪
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信