The Zhegalkin polynomials form a basis for this system, as does the Sheffer stroke.
The Zhegalkin polynomials form a basis for this system, as does the Sheffer stroke. The De Morgan identities can apply to expressions in this system, with which there is associated a namesake satisfiability problem, which the Cooke-Levin theorem holds is NP complete. Most programming languages have comparison operators that return a data type named for it. Including derived operations such as an exclusive version of one operator, for 10 points, identify this system of operations on a set, whose basic binary operators are "or" along with "and."
The Zhegalkin polynomials form a basis for this system, as does the Sheffer stroke.
{Boolean} logic