arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1311.2690math.LO
收藏

可判定簇中项运算的有界本质性质

Bounding essential arities of term operations in finitely decidable varieties

Matthew Smedberg

摘要:

设$\mathbf{A}$是生成可判定簇且具有非平凡强可解根$τ$的有限代数.我们提供了变量数量的改进界限,其中术语可能对$τ$内的变化敏感。我们利用一个多排序的代数结构,合并的方法开发的Valeriote和McKenzie的调查强交换的局部有限的可判定品种与Idziak的局部有限的同余模可判定品种。

英文摘要:

Let $\mathbf{A}$ be a finite algebra generating a finitely decidable variety and having nontrivial strongly solvable radical $τ$. We provide an improved bound on the number of variables in which a term can be sensitive to changes within $τ$. We utilize a multi-sorted algebraic construction, amalgamating the methods developed by Valeriote and McKenzie for the investigation of strongly abelian locally finite decidable varieties with those of Idziak for locally finite congruence modular finitely decidable varieties.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑