Abstract
In multiple-valued logic theories, the decision and construction for Sheffer functions is an important problem. The decision for Sheffer functions is interrelated to the decision for completeness of functions set, and the solution of the later problem depends on determining all precomplete classes. For partial multiple-valued logic, the decision problem for completeness had been thoroughly solved by determining all the precomplete classes (seven species altogether), but the decision and construction for Sheffer functions haven't been solved completely. In this paper, we focus on the third species of precomplete sets - the simply separable function set, research and discuss the number and construction problem of it.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
