The idea of semantic normal form originally developed by Jankov [17] for Brouwerian semilattices is made applicable to the variety of equivalential algebras and thereby, to a broader family of locally finite and permutable varieties obeying the conditions of Fregeanity i.e. point regularity and congruence orderability. It is proved that every term in the language of such a variety can be equivalently expressed
with the help of a relatively small set of building blocks manufactured from so-called monolith assignments
