# Orderable pseudovarieties

## Speaker:

## Date:

## Venue:

Pseudovarieties of ordered semigroups have been introduced as a refined algebraic classifying tool for regular languages in the sense of Eilenberg's Correspondence Theorem. Forgetting the order, each such pseudovariety generates a pseudovariety of semigroups. A natural question is which pseudovarieties of semigroups arise in this way from non-selfdual pseudovarieties of ordered semigroups which, for the purpose of the talk, we call orderable.