Pełnotekstowe zasoby PLDML oraz innych baz dziedzinowych są już dostępne w nowej Bibliotece Nauki.
Zapraszamy na https://bibliotekanauki.pl
Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 6

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych:  hypersubstitution
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

Presolid varieties of n-semigroups

100%
EN
he class of all M-solid varieties of a given type t forms a complete sublattice of the lattice ℒ(τ) of all varieties of algebrasof type t. This gives a tool for a better description of the lattice ℒ(τ) by characterization of complete sublattices. In particular, this was done for varieties of semigroups by L. Polák ([10]) as well as by Denecke and Koppitz ([4], [5]). Denecke and Hounnon characterized M-solid varieties of semirings ([3]) and M-solid varieties of groups were characterized by Koppitz ([9]). In the present paper we will do it for varieties of n-semigroups. An n-semigroup is an algebra of type (n), where the operation satisfies the [i,j]-associative laws for 1 ≤ i ≤ j ≤ n, introduced by Dörtnte ([2]). It is clear that the notion of a 2-semigroup is the same as the notion of a semigroup. Here we will consider the case n ≥ 3.
2
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

The semantical hyperunification problem

100%
EN
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. The kernel of this induced mapping is called the kernel of the hypersubstitution, and it is a fully invariant congruence relation on the (absolutely free) term algebra $F_{τ}(X)$ of the considered type ([2]). If V is a variety of type τ, we consider the composition of the natural homomorphism with the mapping induced by a hypersubstitution. The kernel of this mapping is called the semantical kernel of the hypersubstitution with respect to the given variety. If the pair (s,t) of terms belongs to the semantical kernel of a hypersubstitution, then this hypersubstitution equalizes s and t with respect to the variety. Generalizing the concept of a unifier, we define a semantical hyperunifier for a pair of terms with respect to a variety. The problem of finding a semantical hyperunifier with respect to a given variety for any two terms is then called the semantical hyperunification problem. We prove that the semantical kernel of a hypersubstitution is a fully invariant congruence relation on the absolutely free algebra of the given type. Using this kernel, we define three relations between sets of hypersubstitutions and sets of varieties and introduce the Galois correspondences induced by these relations. Then we apply these general concepts to varieties of semigroups.
3
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

Hyperidentities in many-sorted algebras

100%
EN
The theory of hyperidentities generalizes the equational theory of universal algebras and is applicable in several fields of science, especially in computers sciences (see e.g. [2,1]). The main tool to study hyperidentities is the concept of a hypersubstitution. Hypersubstitutions of many-sorted algebras were studied in [3]. On the basis of hypersubstitutions one defines a pair of closure operators which turns out to be a conjugate pair. The theory of conjugate pairs of additive closure operators can be applied to characterize solid varieties, i.e., varieties in which every identity is satisfied as a hyperidentity (see [4]). The aim of this paper is to apply the theory of conjugate pairs of additive closure operators to many-sorted algebras.
4
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

Tree transformations defined by hypersubstitutions

100%
EN
Tree transducers are systems which transform trees into trees just as automata transform strings into strings. They produce transformations, i.e. sets consisting of pairs of trees where the first components are trees belonging to a first language and the second components belong to a second language. In this paper we consider hypersubstitutions, i.e. mappings which map operation symbols of the first language into terms of the second one and tree transformations defined by such hypersubstitutions. We prove that the set of all tree transformations which are defined by hypersubstitutions of a given type forms a monoid with respect to the composition of binary relations which is isomorphic to the monoid of all hypersubstitutions of this type. We characterize transitivity, reflexivity and symmetry of tree transformations by properties of the corresponding hypersubstitutions. The results will be applied to languages built up by individual variables and one operation symbol of arity n ≥ 2.
5
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

Hypersubstitutions in orthomodular lattices

100%
EN
It is shown that in the variety of orthomodular lattices every hypersubstitution respecting all absorption laws either leaves the lattice operations unchanged or interchanges join and meet. Further, in a variety of lattices with an involutory antiautomorphism a semigroup generated by three involutory hypersubstitutions is described.
6
100%
EN
Hypersubstitutions are mappings which map operation symbols to terms. The set of all hypersubstitutions of a given type forms a monoid with respect to the composition of operations. Together with a second binary operation, to be written as addition, the set of all hypersubstitutions of a given type forms a left-seminearring. Monoids and left-seminearrings of hypersubstitutions can be used to describe complete sublattices of the lattice of all varieties of algebras of a given type. The complexity of a hypersubstitution can be measured by the complexity of the resulting terms. We prove that the set of all hypersubstitutions with a complexity greater than a given natural number forms a sub-left-seminearring of the left-seminearring of all hypersubstitutions of the considered type. Next we look to a special complexity measure, the operation symbol count op(t) of a term t and determine the greatest M-solid variety of semigroups where $M = H₂^{op}$ is the left-seminearring of all hypersubstitutions for which the number of operation symbols occurring in the resulting term is greater than or equal to 2. For every n ≥ 1 and for $M = Hₙ^{op}$ we determine the complete lattices of all M-solid varieties of semigroups.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.