Hereditary properties of algebras with respect to inductive limits
A construction of all homomorphisms of a heterogeneous algebra into an algebra of the same type is presented. A relational structure is assigned to any heterogeneous algebra, and homomorphisms between these relational structures make it possible to construct homomorphisms between heterogeneous algebras. Homomorphisms of relational structures can be constructed using homomorphisms of algebras that are described in [11].
Graph algebras establish a connection between directed graphs without multiple edges and special universal algebras of type (2,0). We say that a graph G satisfies an identity s ≈ t if the correspondinggraph algebra A(G) satisfies s ≈ t. A graph G is called associative if the corresponding graph algebra A(G) satisfies the equation (xy)z ≈ x(yz). An identity s ≈ t of terms s and t of any type τ is called a hyperidentity of an algebra A̲ if whenever the operation symbols occurring in s and t are replaced...