Sep 10, 2022 · We first define binary trees and their congruences, we then study conditions which will enable us to prove that every congruence preserving ...
Nov 8, 2020 · We show that on the algebra of binary trees whose leaves are labeled by letters of an alphabet containing at least three letters, a function is ...
A function on an algebra is congruence preserving if, for any congruence, it maps pairs of congruent elements onto pairs of congruent elements.
An algebra is said to be affine complete if every congruence preserving function is a polynomial function. We show that the algebra of (possibly empty) binary ...
May 14, 2021 · A function on an algebra is congruence preserving if, for any congruence, it maps pairs of congruent elements onto.
Oct 30, 2020 · We here prove that the free algebra with one binary operation and at least three generators is 1–affine complete, ie, every unary function preserving ...
A function on an algebra is congruence preserving if, for any congruence, it maps pairs of congruent elements onto pairs of congruent elements.
Sep 10, 2024 · This exhibits an example of a non commutative and non associative affine complete algebra. As far as we know, it is the first example of such an ...
Affine completeness of the algebra of full binary trees · Polynomial Completeness in Algebraic Systems · Congruence-preserving functions on distributive lattices.
A function on an algebra is congruence preserving if, for any congruence, it maps pairs of congruent elements onto pairs of congruent elements.