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

Mikhail Starostin

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.

Knowledge Graph

arrow_drop_up

Comments

Sign up or login to leave a comment