Abstract
It is extremely difficult to make general statements about functional completeness. (For the main reference on the subject see Post [2].) In this paper we restrict ourselves to the case of unary functions in a finite valued logic, and prove a result concerning minimal functionally complete sets, along with a necessary and sufficient condition for completeness. A basic familiarity with group theory would be helpful.
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
