Results 21 to 30 of about 119 (83)
All Regular-Solid Varieties of Idempotent Semirings
Discussiones Mathematicae - General Algebra and Applications, 2017 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 of semirings.
Hounnon Hippolyte
doaj +1 more source
Tree transformations defined by hypersubstitutions
Discussiones Mathematicae - General Algebra and Applications, 2001 Let \(\{f_i\mid i\in I\}\) be a set of operation symbols of type \(\tau_1=(n_i)_{i\in I}\) where \(f_i\) is \(n_i\)-ary, and let \(\{g_j\mid j\in J\}\) be a set of operation symbols of type \(\tau_2=(n_j)_{j\in J}\) where \(g_j\) is \(n_j\)-ary. Let \(W_{\tau_1}(X)\) and \(W_{\tau_2}(X)\) denote the sets of all terms of types \(\tau_1\) and \(\tau_2 ...
Arworn, Srichan, Denecke, Klaus-Dieter
openaire +2 more sources
Unsolid and fluid strong varieties of partial algebras
International Journal of Mathematics and Mathematical Sciences, Volume 2006, Issue 1, 2006., 2006 A partial algebra 𝒜=(A;(fiA) i∈I) consists of a set A and an indexed set (fiA) i∈I of partial operations fiA:Ani⊸→A. Partial operations occur in the algebraic description of partial recursive functions and Turing machines. A pair of terms p ≈ q over the partial algebra 𝒜 is said to be a strong identity in 𝒜 if the right‐hand side is defined whenever ...
S. Busaman, K. Denecke
wiley +1 more source
The Clone of K*(n, r)-Full Terms
Discussiones Mathematicae - General Algebra and Applications, 2019 Let τn be a type of algebras in which all operation symbols have arity n, for a fixed n ≥ 1. For 0 < r ≤ n, this paper introduces a special kind of n-ary terms of type τn called K*(n, r)-full terms. The set of all K*(n, r)-full terms of type τn is closed
Wattanatripop Khwancheewa +1 more
doaj +1 more source
All completely regular elements in $Hyp_{G}(n)$ [PDF]
, 2013 In Universal Algebra, identities are used to classify algebras into collections, called varieties and hyperidentities are use to classify varieties into collections, called hypervarities.
Boonmee, Ampika, Leeratanavalee, Sorasak
core +1 more source
The degree of proper hypersubstitutions
Scientiae Mathematicae Japonicae, 2007 For a variety \(V\) of type \(\tau ,\) a hypersubstitution which preserves all identities of \(V\) is called a \(V\)-proper hypersubstitution. The hypersubstitutions in the set \(P(V)\) of all \(V\)-proper hypersubstitutions can be partitioned according to an equivalence relation \( \backsim _{V}\) introduced by \textit{J.
Denecke, K., Koppitz, J., Srithus, R.
openaire +2 more sources
M-solid generalized non-deterministic varieties [PDF]
, 2016 A generalized non-deterministic hypersubstitution is a mapping which maps operation symbols of type τ to the set of terms of the same type which does not necessarily preserve the arity.
Lekkoksung, Somsak
core +1 more source
All maximal unit-regular elements of Relhyp((m),(n)) [PDF]
, 2023 Any relational hypersubstitution for algebraic systems of type (τ, τ′) = ((mi)i∈I , (nj )j∈J ) is a mapping which maps any mi-ary operation symbol to an mi-ary term and maps any nj-ary relational symbol to an nj-ary relational term preserving arities ...
Kunama, Pornpimol +1 more
core +1 more source
, 2007 A non-deterministic hypersubstitution maps any operation symbol of a tree language of type τ to a set of trees of the same type, i.e. to a tree language.
Denecke, Klaus, Glubudom, Prisana
core +1 more source
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2012 A generalized hypersubstitution of type τ = (2) is a mapping which maps the binary operation symbol f to a term σ(f) which does not necessarily preserve the arity. Any such σ can be inductively extended to a map σ̂ on the set of all terms of type τ = (2),
Puninagool Wattapong +1 more
doaj +1 more source