Implicit completeness criterion in three-valued logic in terms of maximal classes

03/30/2021
by   Mikhail Starostin, et al.
0

Implicit expressability was introduced by A.V. Kuznetsov in 1979 as generalization of functional expressability. Set of functions is called implicitly complete if any function has an implicit representation over this set. The system of all implicitly maximal classes in three-valued logic is described. The implicit completeness criterion is stated.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset