ALL MAXIMAL COMPLETELY REGULAR SUBMONOIDS OF HypG(2)
Journal Title: Discussiones Mathematicae - General Algebra and Applications - Year 2017, Vol 37, Issue 1
Abstract
In this paper we consider mappings σ which map the binary operation symbol f to the term σ(f) which do not necessarily preserve the arity. These mapping are called generalized hypersubstitutions of type τ = (2) and we denote the set of all these generalized hypersubstitutions of type τ = (2) by HypG(2). The set HypG(2) together with a binary operation defined on this set and the identity generalized hypersubstitution which maps f to the term f(x1, x2) forms a monoid. In this paper, we determine all maximal completely regular submonoids of this monoid.
Authors and Affiliations
Pornpimol Kunama, Sorasak Leeratanavalee
Keywords
Related Articles
- EP ID EP304549
- DOI -
- Views 32
- Downloads 0
RELATION BETWEEN (FUZZY) GODEL IDEALS AND ¨ (FUZZY) BOOLEAN IDEALS IN BL-ALGEBRAS
In this paper, we study relationships between among (fuzzy) Boolean ideals, (fuzzy) G¨odel ideals, (fuzzy) implicative filters and (fuzzy) Boolean filters in BL-algebras. In [9], there is an example which shows that a G¨...
SUPERIOR SUBALGEBRAS AND IDEALS OF BCK/BCI-ALGEBRAS
The notions of superior subalgebras and (commutative) superior ideals are introduced, and their relations and related properties are investigated. Conditions for a superior ideal to be commutative are provided.
ON A PERIODIC PART OF PSEUDO-BCI-ALGEBRAS
In the paper the connections between the set of some maximal elements of a pseudo-BCI-algebra and deductive systems are established. Using these facts, a periodic part of a pseudo-BCI-algebra is studied.
ALL REGULAR-SOLID VARIETIES OF IDEMPOTENT SEMIRINGS
The lattice of all regular-solid varieties of semirings splits in two complete sublattices: the sublattice of all idempotent regular-solid varieties of semirings and the sublattice of all normal regular-solid varieties o...
A SHORT NOTE ON LCBA—FUZZY LOGIC WITH A NON-ASSOCIATIVE CONJUNCTION
We significantly simplify the axiomatic system LCBA for fuzzy logic with a non-associative conjunction.