I have seen functional-completeness (in regards to boolean functions) defined as:
A set X of truth-functions (of 2-valued logic) is functionally complete if and only if for each of the five defined classes, there is a member of X which does not belong to that class
With those 5 classes being:
So since | is functionally-complete, this means it is not any one of the 5 type of functions listed above, right?
But I am not quite seeing how it is not self-dual, it seems like it IS self-dual. Could someone go over the self-dual functions and show the sheffer stroke is not self-dual?