Theorem. A system of boolean functions is functionally complete if and only if this system does
not entirely belong to any of T0, T1, L, M, S.
The mentioned theorem is called Post's completeness criterion and is due to Emil Post. What this
criterion says is that in order for a system of boolean functions to be functionally complete, this
system should have
• at least one function that does not preserve zero (i.e. it is not in T0), and
• at least one function that does not preserve one (i.e. it is not in T1), and
• at least one function that is not linear (i.e. it is not in L), and
• at least one function that is not monotone (i.e. it is not in M), and
• at least one function that is not self-dual (i.e. it is not in S).
Of course, one function may combine some of these roles, e.g., a function may not preserve one and,
at the same time, not be monotone.

if you are able to derive set <AND,OR,NOT> .then it is colled Functionally complete.

in this question we cant able to derive complement . so it is not Functionally complete. but with the help of 0 we can derive set< OR,NOT> so it is partially functionally complete.