Refine
Has Fulltext
- no (106)
Year of publication
Document Type
- Article (94)
- Monograph/Edited Volume (11)
- Doctoral Thesis (1)
Is part of the Bibliography
- yes (106)
Keywords
- linear term (5)
- clone (4)
- linear hypersubstitution (4)
- partial clone (4)
- formula (2)
- linear formula (2)
- linear tree language (2)
- term (2)
- Menger algebra of rank n (1)
- Operation (1)
Institute
- Institut für Mathematik (106)
The superposition operation S-n,S-A, n >= 1, n is an element of N, maps to each (n + 1)-tuple of n-ary operations on a set A an n-ary operation on A and satisfies the so-called superassociative law, a generalization of the associative law. The corresponding algebraic structures are Menger algebras of rank n. A partial algebra of type (n + 1) which satisfies the superassociative law as weak identity is said to be a partial Menger algebra of rank n. As a generalization of linear terms we define r-terms as terms where each variable occurs at most r-times. It will be proved that n-ary r-terms form partial Menger algebras of rank n. In this paper, some algebraic properties of partial Menger algebras such as generating systems, homomorphic images and freeness are investigated. As generalization of hypersubstitutions and linear hypersubstitutions we consider r-hypersubstitutions.U
Partial clones
(2020)
A set C of operations defined on a nonempty set A is said to be a clone if C is closed under composition of operations and contains all projection mappings. The concept of a clone belongs to the algebraic main concepts and has important applications in Computer Science. A clone can also be regarded as a many-sorted algebra where the sorts are the n-ary operations defined on set A for all natural numbers n >= 1 and the operations are the so-called superposition operations S-m(n) for natural numbers m, n >= 1 and the projection operations as nullary operations. Clones generalize monoids of transformations defined on set A and satisfy three clone axioms. The most important axiom is the superassociative law, a generalization of the associative law. If the superposition operations are partial, i.e. not everywhere defined, instead of the many-sorted clone algebra, one obtains partial many-sorted algebras, the partial clones. Linear terms, linear tree languages or linear formulas form partial clones. In this paper, we give a survey on partial clones and their properties.
A term, also called a tree, is said to be linear, if each variable occurs in the term only once. The linear terms and sets of linear terms, the so-called linear tree languages, play some role in automata theory and in the theory of formal languages in connection with recognizability. We define a partial superposition operation on sets of linear trees of a given type and study the properties of some many-sorted partial clones that have sets of linear trees as elements and partial superposition operations as fundamental operations. The endomorphisms of those algebras correspond to nondeterministic linear hypersubstitutions.
A term t is linear if no variable occurs more than once in t. An identity s ≈ t is said to be linear if s and t are linear terms. Identities are particular formulas. As for terms superposition operations can be defined for formulas too. We define the arbitrary linear formulas and seek for a condition for the set of all linear formulas to be closed under superposition. This will be used to define the partial superposition operations on the set of linear formulas and a partial many-sorted algebra Formclonelin(τ, τ′). This algebra has similar properties with the partial many-sorted clone of all linear terms. We extend the concept of a hypersubstitution of type τ to the linear hypersubstitutions of type (τ, τ′) for algebraic systems. The extensions of linear hypersubstitutions of type (τ, τ′) send linear formulas to linear formulas, presenting weak endomorphisms of Formclonelin(τ, τ′).
Hypersubstitutions are mappings which map operation symbols to terms. Terms can be visualized by trees. Hypersubstitutions can be extended to mappings defined on sets of trees. The nodes of the trees, describing terms, are labelled by operation symbols and by colors, i.e. certain positive integers. We are interested in mappings which map differently-colored operation symbols to different terms. In this paper we extend the theory of hypersubstitutions and solid varieties to multi-hypersubstitutions and colored solid varieties. We develop the interconnections between such colored terms and multihypersubstitutions and the equational theory of Universal Algebra. The collection of all varieties of a given type forms a complete lattice which is very complex and difficult to study; multi-hypersubstitutions and colored solid varieties offer a new method to study complete sublattices of this lattice.
Generalizing a linear expression over a vector space, we call a term of an arbitrary type tau linear if its every variable occurs only once. Instead of the usual superposition of terms and of the total many-sorted clone of all terms in the case of linear terms, we define the partial many-sorted superposition operation and the partial many-sorted clone that satisfies the superassociative law as weak identity. The extensions of linear hypersubstitutions are weak endomorphisms of this partial clone. For a variety V of one-sorted total algebras of type tau, we define the partial many-sorted linear clone of V as the partial quotient algebra of the partial many-sorted clone of all linear terms by the set of all linear identities of V. We prove then that weak identities of this clone correspond to linear hyperidentities of V.
The dimension of a variety V of algebras of a given type was introduced by E. Graczynska and D. Schweigert in [7] as the cardinality of the set of all derived varieties of V which are properly contained in V. In this paper, we characterize all solid varieties of dimensions 0, 1, and 2; prove that the dimension of a variety of finite type is at most N-0; give an example of a variety which has infinite dimension; and show that for every n is an element of N there is a variety with dimension n. Finally, we show that the dimension of a variety is related to the concept of the semantical kernel of a hypersubstitution and apply this connection to calculate the dimension of the class of all algebras of type tau = (n).
An n-ary cooperation is a mapping from a nonempty set A to the nth copower of A. A clone of cooperations is a set of cooperations which is closed under superposition and contains all injections. Coalgebras are pairs consisting of a set and a set of cooperations defined on this set. We define terms for coalgebras, coidentities and cohyperidentities. These concepts will be applied to give a new solution of the completeness problem for clones of cooperations defined on a two-element set and to separate clones of cooperations by coidentities.
Pre-solid varieties
(1994)
Hyperassociative semigroups
(1994)
Edge-solid varieties
(1995)
Clones and hyperidentities
(1995)
Clones and hyperidentities
(1996)
Clones and Hyperidentities
(1997)
Hyperequational theory
(1997)
Tame congruence theory
(1998)
Hyperequational Theorie
(1998)
Osnovi na Aritmetikata
(1999)
Solid varieties of semirings
(2000)
Hyperidentities and clones
(2000)
The theory of hyperidentities generalises the equational theory of universal algebras and is applicable in several fields of science, especially in computer sciences. This book presents the theory of hyperidentities and its relation to clone identities. The basic concept of hypersubstitution is used to introduce the monoid of hypersubstitutions, hyperidentities, M-hyperidentities, solid and M-solid varieties. This work integrates into a coherent framework many results scattered throughout the literature over the last eighteen years. In addition, the book contains some applications of hyperidentities to the functional completenes problem in multiple-valued logic. The general theory is also extended to partial algberas. The last chapter contains a list of exercises and open problems with suggestions of future work in this area of research.
M-solidity testing systems
(2002)
Valuations of Terms
(2003)
Let tau be a type of algebras. There are several commonly used measurements of the complexity of terms of type tau, including the depth or height of a term and the number of variable symbols appearing in a term. In this paper we formalize these various measurements, by defining a complexity or valuation mapping on terms. A valuation of terms is thus a mapping from the absolutely free term algebra of type tau into another algebra of the same type on which an order relation is defined. We develop the interconnections between such term valuations and the equational theory of Universal Algebra. The collection of all varieties of a given type forms a complete lattice which is very complex and difficult to study; valuations of terms offer a new method to study complete sublattices of this lattice
Clones of n-ary algebras
(2003)