AbstractBy an N-semigroup we mean a commutative archimedean cancellative semigroup without idempotent. A congruence ϱ on an N-semigroup S is called an N-congruence on S if S/g9 is an N-semigroup. This paper discusses how to determine N-congruences on S in the two ways. There is a maximal N-congruence ϱ0 on S. S/ϱ0 is an irreducible N-semigroup. Every N-semigroup is isomorphic to a subdirect product of an irreducible N-semigroup and an abelian group
AbstractLet S be a commutative Cancellative semigroup. Under what condition on S is S nontrivially h...
Semigroups whose congruences form a chain are often termed Δ-semigroups. The commutative Δ-semigroup...
AbstractA congruence ρT on a subsemigroup T of S extends to the semigroup S, if there exists a congr...
AbstractBy an N-semigroup we mean a commutative archimedean cancellative semigroup without idempoten...
We introduce in this thesis a new family of semigroup congruences, and we set out to prove that it i...
Investigations of the lattice of congruences on a semigroup have taken two different directions. One...
Throughout Z+ denotes the semigroup of all positive integers, Z+ =Z+ U|0) the semigroup of all non-n...
It is well known that the set of congruences on a semigroup (or indeed on any Algebra) forms a latti...
In 1966, Howie showed that the semigroup generated by all nonidentity idempotent transformations of...
Computational semigroup theory is an area of research that is subject to growing interest. The deve...
AbstractLet τ be a congruence on a full regular subsemigroup R of a regular semigroup S. The least c...
Semigroups whose congruences form a chain are often termed ∆-semigroups. The commutative ∆-semigroup...
AbstractLet S be a regular semigroup and Con S the congruence lattice of S. If C is an isomorphism c...
We characterize all the radical congruence systems for finite semigroups which are systems of greate...
AbstractIn 1966, J. M. Howie (J. London Math. Soc.41, 707–716) showed that the semigroup generated b...
AbstractLet S be a commutative Cancellative semigroup. Under what condition on S is S nontrivially h...
Semigroups whose congruences form a chain are often termed Δ-semigroups. The commutative Δ-semigroup...
AbstractA congruence ρT on a subsemigroup T of S extends to the semigroup S, if there exists a congr...
AbstractBy an N-semigroup we mean a commutative archimedean cancellative semigroup without idempoten...
We introduce in this thesis a new family of semigroup congruences, and we set out to prove that it i...
Investigations of the lattice of congruences on a semigroup have taken two different directions. One...
Throughout Z+ denotes the semigroup of all positive integers, Z+ =Z+ U|0) the semigroup of all non-n...
It is well known that the set of congruences on a semigroup (or indeed on any Algebra) forms a latti...
In 1966, Howie showed that the semigroup generated by all nonidentity idempotent transformations of...
Computational semigroup theory is an area of research that is subject to growing interest. The deve...
AbstractLet τ be a congruence on a full regular subsemigroup R of a regular semigroup S. The least c...
Semigroups whose congruences form a chain are often termed ∆-semigroups. The commutative ∆-semigroup...
AbstractLet S be a regular semigroup and Con S the congruence lattice of S. If C is an isomorphism c...
We characterize all the radical congruence systems for finite semigroups which are systems of greate...
AbstractIn 1966, J. M. Howie (J. London Math. Soc.41, 707–716) showed that the semigroup generated b...
AbstractLet S be a commutative Cancellative semigroup. Under what condition on S is S nontrivially h...
Semigroups whose congruences form a chain are often termed Δ-semigroups. The commutative Δ-semigroup...
AbstractA congruence ρT on a subsemigroup T of S extends to the semigroup S, if there exists a congr...