【24h】

A characterization of Mal'cev's preiterative algebras

机译:Mal'cev代数代数的刻画

获取原文

摘要

In universal algebras, propositional calculi, combinatorial switching circuits new operations are formed by composition. The process of composing operations is usually described by Menger algebras or by partial or graded algebras (clones). The inherent limitations are due to the preservation of arities. A.I. Mal'cev avoided this by introducing an algebra P@@@@ &equil; 0A,&zgr;,τ,Δ,* of type 1,1,1,2 on the set 0A of all finitary operations on A such that the subalgebras of P@@@@ (called preiterative algebras) agree with the sets of all polynomials of universal algebras on A. In this paper, we study the abstract structure of these concrete preiterative algebras; that is, we describe the preiterative algebras in terms of the properties of &zgr;, τ, Δ, and * only.

机译:

在通用代数,命题演算,组合切换电路中,新的运算是由成分组成的。合成运算的过程通常由Menger代数或部分或渐变代数(克隆)描述。固有的局限性是由于保留了友善。我Mal'cev通过引入代数P @@@@&equil;来避免这种情况。 A上所有最终运算的集合0 A 的类型<1,1,1,2>的<0 A ,&zgr;,τ,Δ,*> P @@@@的子代数(称为称谓代数)与A上通用代数的所有多项式的集合一致。也就是说,我们仅根据&zgr;,τ,Δ和*的性质来描述阶代数。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号