No label defined (Q3978820)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 12939
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 12939 |
Statements
25 June 1992
0 references
congruence permutable algebra
0 references
tolerance trivial algebra
0 references
BCK-algebras
0 references
0.9038279
0 references
0.89617515
0 references
0 references
0 references
0 references
0.8835989
0 references
Let \(A=(A;F)\) denote a given algebra. A reflexive symmetric binary relation \(\tau\) on \(A\) is called a tolerance on \(A\) if it is compatible with every operation in \(F\). A congruence on \(A\) is therefore just a transitive tolerance on \(A\). An algebra \(A\) is called tolerance trivial if any tolerance on \(A\) is a congruence. The authors show that every tolerance trivial algebra is congruence permutable. Then they initiate the study of tolerances on BCK-algebras and get the following results. The set \(\{a\in A:(a,0)\in\tau\}\) is an ideal of \(A\), called the kernel of \(\tau\), Let \(I\) be an ideal of \(A\). We define \(\varphi_ I=\{(a,b)\in A^ 2:ab,ba\in I\}\). Then \(\varphi_ I\) is a congruence and the greatest tolerance on \(A\) whose kernel is \(I\). It is characterized by the existence of some BCK-terms that \((a,b)\) is in the least tolerance on \(A\) with a given kernel. Any tolerance trivial BCK-algebra is directed upward. Any directed commutative BCK-algebra is tolerance trivial. However, tolerance trivial algebras need not be commutative. Also congruence permutable BCK-algebras need not be tolerance trivial.
0 references