The lattice of subautomata of an automaton: A survey.
The lattice of subvarieties of the biregularization of the variety of Boolean algebras
Let τ: F → N be a type of algebras, where F is a set of fundamental operation symbols and N is the set of all positive integers. An identity φ ≈ ψ is called biregular if it has the same variables in each of it sides and it has the same fundamental operation symbols in each of it sides. For a variety V of type τ we denote by the biregularization of V, i.e. the variety of type τ defined by all biregular identities from Id(V). Let B be the variety of Boolean algebras of type , where and . In...
The lattice of varieties and pseudovarieties of band monoids.
The lattice of varieties of fibered automata
The class of all fibered automata is a variety of two-sorted algebras. This paper provides a full description of the lattice of varieties of fibred automata.
The lattice of varieties of *-regular band monoids.
The logic of categories of partial functions and its applications [Book]
The minimal closed monoids for the Galois connection -
The minimal nontrivial endomorphism monoids of congruence lattices of algebras defined on a finite set are described. They correspond (via the Galois connection -) to the maximal nontrivial congruence lattices investigated and characterized by the authors in previous papers. Analogous results are provided for endomorphism monoids of quasiorder lattices .
The minimal extension of sequences III. On problem 16 of Grätzer and Kisielewicz
The main result of this paper is a description of totally commutative idempotent groupoids. In particular, we show that if an idempotent groupoid (G,·) has precisely m ≥ 2 distinct essentially binary polynomials and they are all commutative, then G contains a subgroupoid isomorphic to the groupoid described below. In [2], this fact was proved for m = 2.
The monoid of generalized hypersubstitutions of type τ = (n)
A (usual) hypersubstitution of type τ is a function which takes each operation symbol of the type to a term of the type, of the same arity. The set of all hypersubstitutions of a fixed type τ forms a monoid under composition, and semigroup properties of this monoid have been studied by a number of authors. In particular, idempotent and regular elements, and the Green’s relations, have been studied for type (n) by S.L. Wismath. A generalized hypersubstitution of type τ=(n) is a mapping σ which takes...
The monoid of strong endomorphisms of a graph.
The notion of an elementary subsystem for a Boolean-valued relational system
The number of minimal varieties of idempotent groupoids
The observational predicate calculus and complexity of computations (Preliminary communication)
The one-block property in varieties of semigroups.
The order of generalized hypersubstitutions of type .
The order of normalform hypersubstitutions of type (2)
In [2] it was proved that all hypersubstitutions of type τ = (2) which are not idempotent and are different from the hypersubstitution whichmaps the binary operation symbol f to the binary term f(y,x) haveinfinite order. In this paper we consider the order of hypersubstitutionswithin given varieties of semigroups. For the theory of hypersubstitution see [3].
The ordering of commutative terms
By a commutative term we mean an element of the free commutative groupoid of infinite rank. For two commutative terms , write if contains a subterm that is a substitution instance of . With respect to this relation, is a quasiordered set which becomes an ordered set after the appropriate factorization. We study definability in this ordered set. Among other things, we prove that every commutative term (or its block in the factor) is a definable element. Consequently, the ordered set has...
The order-sum in classes of partially ordered algebras.
The positive and generalized discriminators don't exist
In this paper it is proved that there does not exist a function for the language of positive and generalized conditional terms that behaves the same as the discriminator for the language of conditional terms.
The pseudovariety is hyperdecidable