KonkurStudy
همه کارت‌ها

Functional Completeness and the Sheffer Stroke

A set of connectives is functionally complete if it can express every truth function; {¬,∧}\{\neg, \land\}, {¬,∨}\{\neg, \lor\}, and {¬,→}\{\neg, \to\} all qualify, and the single connectives NAND (∣\mid) and NOR (↓\downarrow) each suffice on their own.

کارت مفهوم کنکور ارشد علوم کامپیوتر