Reduced Sets of Connectives
A set of logical connectives is called complete if every propositional formula is tautologically equivalent to a formula with just the connectives in that set. There are many complete sets of connectives, including, and . There are two binary connectives that are complete on their own, corresponding to NAND and NOR, respectively. Some pairs are not complete, for example .
Read more about this topic: Propositional Formula
Famous quotes containing the words reduced and/or sets:
“Narrowed-down by her early editors and anthologists, reduced to quaintness or spinsterish oddity by many of her commentators, sentimentalized, fallen-in-love with like some gnomic Garbo, still unread in the breadth and depth of her full range of work, she was, and is, a wonder to me when I try to imagine myself into that mind.”
—Adrienne Rich (b. 1929)
“I would rather have as my patron a host of anonymous citizens digging into their own pockets for the price of a book or a magazine than a small body of enlightened and responsible men administering public funds. I would rather chance my personal vision of truth striking home here and there in the chaos of publication that exists than attempt to filter it through a few sets of official, honorably public-spirited scruples.”
—John Updike (b. 1932)