Ideal extensions of graph algebras
Let and be graph algebras. In this paper we present the notion of an ideal in a graph algebra and prove that an ideal extension of by always exists. We describe (up to isomorphism) all such extensions.
Ideal nil-extensions of semigroups with semimodular congruence lattices.
Ideals and congruence kernels of algebras
Ideals of binary relational systems
Ideals of -algebras
Idées et maquettes de structures algébriques
Idempotency of Circuit-induced Exchange Operators.
Idempotent distributive semirings II..
Idempotent pre-generalized hypersubstitutions of type .
Idempotent separating congruences on an orthodox semigroup via the least inverse congruence.
Idempotent Subreducts of Semimodules over Commutative Semirings
Identities for globals (complex algebras) of algebras
Implication algebras
We introduce the concepts of pre-implication algebra and implication algebra based on orthosemilattices which generalize the concepts of implication algebra, orthoimplication algebra defined by J.C. Abbott [2] and orthomodular implication algebra introduced by the author with his collaborators. For our algebras we get new axiom systems compatible with that of an implication algebra. This unified approach enables us to compare the mentioned algebras and apply a unified treatment of congruence properties....
Implication and equivalential reducts of basic algebras
A term operation implication is introduced in a given basic algebra and properties of the implication reduct of are treated. We characterize such implication basic algebras and get congruence properties of the variety of these algebras. A term operation equivalence is introduced later and properties of this operation are described. It is shown how this operation is related with the induced partial order of and, if this partial order is linear, the algebra can be reconstructed by means of...
Implicit operations on the categories of universal algebras.
Incidence structures and closure spaces
Incidence structures of independent sets
Incidence structures of type
Every incidence structure (understood as a triple of sets , ) admits for every positive integer an incidence structure where () consists of all independent -element subsets in () and is determined by some bijections. In the paper such incidence structures are investigated the ’s of which have their incidence graphs of the simple join form. Some concrete illustrations are included with small sets and .
Inclusion properties of the intersection convolution of relations.
Independence of Equational Classes