Abstract
Decisions and construction for Sheffer functions in P/sub k/ and P/sub k/* in partial k-valued logic are considered. The solution of these problems depends on the solution of the decision problem of completeness in P/sub k/ and P/sub k/* and is reduced to determining the minimal coverings of precomplete classes in P/sub k/ and P/sub k/*, respectively. The pseudo-linear function set denoted by L/sub p/ is proved here to be the component part of the minimal covering of precomplete classes in P/sub k/*. >
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.
