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)
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.
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).
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.
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