Abstract
We construct a series of maximum subalgebras of direct products of algebras of finite-valued logics, which are subdirect products of the corresponding Boolean algebras. We show that subdirect products make the largest contribution to the number of maximum subalgebras. The completeness problems is solved in the algebra of vector Boolean functions.
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
