Complete Reducibility of Pseudovarieties
نویسنده
چکیده
The notion of reducibility for a pseudovariety has been introduced as an abstract property which may be used to prove decidability results for various pseudovariety constructions. This paper is a survey of recent results establishing this and the stronger property of complete reducibility for specific pseudovarieties.
منابع مشابه
Some Reducibility Properties for Pseudovarieties of the Form Drh
Let H be a pseudovariety of groups and DRH be the pseudovariety containing all finite semigroups whose regular R-classes belong to H. We study the relationship between reducibility of H and of DRH with respect to several particular classes of systems of equations. The classes of systems considered (of pointlike, idempotent pointlike and graph equations) are known to play a role in decidability ...
متن کامل-Solid Varieties of Languages
In this paper, a characterization of the language varieties and congruence varieties corresponding to M -solid pseudovarieties is presented. Taking into account the isomorphisms of the Eilenberg-type correspondences, each complete sublattice of pseudovarieties corresponds to a complete sublattice of language varieties, as well as another one of congruence varieties. For the varieties of tree la...
متن کاملM-Solid Varieties of Languages
In this paper, a characterization of the language varieties and congruence varieties corresponding toM -solid pseudovarieties is presented. Taking into account the isomorphisms of the Eilenberg-type correspondences, each complete sublattice of pseudovarieties corresponds to a complete sublattice of language varieties, as well as another one of congruence varieties. For the varieties of tree lan...
متن کاملReducibility of Pointlike Problems
We show that the pointlike and the idempotent pointlike problems are reducible with respect to natural signatures in the following cases: the pseudovariety of all finite semigroups in which the order of every subgroup is a product of elements of a fixed set π of primes; the pseudovariety of all finite semigroups in which every regular J-class is the product of a rectangular band by a group from...
متن کاملFinitary Reducibility on Equivalence Relations
We introduce the notion of finitary computable reducibility on equivalence relations on the domain ω. This is a weakening of the usual notion of computable reducibility, and we show it to be distinct in several ways. In particular, whereas no equivalence relation can be Π n+2-complete under computable reducibility, we show that, for every n, there does exist a natural equivalence relation which...
متن کامل