Results 11 to 20 of about 119 (83)
Nd-hypersubstitutions of many-sorted algebras
AbstractA non-deterministic hypersubstitution maps any operation symbol of ...
K. Denecke, S. Lekkoksung
openaire +2 more sources
The order of normalform hypersubstitutions of type (2) [PDF]
Hypersubstitutions were orginally introduced to facilitate the study of hyperidentities of varieties, but they have proved to be of interest in their own right. In particular, there is the question of their order. In a previous paper [\textit{K. Denecke, D. Lau, R. Pöschel} and \textit{D. Schweigert}, Contrib. Gen.
Denecke, Klaus-Dieter, Mahdavi, Kazem
openaire +4 more sources
All Maximal Completely Regular Submonoids of HypG(2) [PDF]
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 ...
Kunama Pornpimol, Leeratanavalee Sorasak
doaj +2 more sources
Hypersubstitutions in orthomodular lattices [PDF]
Let \(\tau\) be a type of algebras. By a hypersubstitution of type \(\tau\) there is either meant a mapping assigning to every fundamental operation symbol of type \(\tau\) a term of type \(\tau\) of the same arity or there is meant the obvious extension of this mapping to the set of all terms of type \(\tau\).
Chajda, Ivan, Länger, Helmut
openaire +2 more sources
Complexity of hypersubstitutions and lattices of varieties [PDF]
The authors develop a general theory of complexity of terms and apply it to define complexity functions for hypersubstitutions. They observe that each complexity function satisfying a certain monotonicity axiom gives rise to a hierarchy of submonoids of the monoid of all hypersubstitutions of a given type and hence to a hierarchy of complete ...
Changphas, Thawhat +1 more
openaire +4 more sources
Complexity of terms, superpositions, and generalized hypersubstitutions [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wattapong Puninagool +1 more
openaire +3 more sources
Maximal submonoids of monoids of hypersubstitutions [PDF]
For a monoid M of hypersubstitutions, the collection of all M -solid varieties forms a complete sublattice of the lattice L(τ) of all varieties of a given type τ . Therefore, by the study of monoids of hypersubstitutions one can get more insight into the structure of the lattice L(τ).
Ilinka Dimitrova, Jörg Koppitz
openaire +2 more sources
Non-deterministic linear hypersubstitutions [PDF]
A non-deterministic hypersubstitution maps operation symbols to sets of terms of the corresponding arity. A non-deterministic hypersubstitution of type τ is said to be linear if it maps any operation symbol to a set of linear terms of the corresponding ...
Prakit Jampachon, Nareupanat Lekkoksung
openaire +2 more sources
The semantical hyperunification problem [PDF]
A hypersubstitution of a fixed type τ maps n-ary operation symbols of the type to n-ary terms of the type. Such a mapping induces a unique mapping defined on the set of all terms of type t.
Denecke, Klaus +2 more
core +1 more source
The Depth of Generalized Full Terms and Generalized Full Hypersubstitutions
We generalize the concept of a full term which was introduced by Denecke and Changphas and the concept of the depth of a hypersubstitution which was introduced by Denecke et al. to the depth of a generalized full term and the depth of a generalized full hypersubstitution and then derive the formular for its depth.
Sarawut Phuapong +2 more
wiley +1 more source

