Abstract
It is proved that every consistent system of equations over a free semilattice of arbitrary rank is equivalent to its finite subsystem. Furthermore, irreducible algebraic sets are studied, and we look at the consistency problem for systems of equations over free semilattices.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
