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:
““Write that down,” the King said to the jury, and the jury eagerly wrote down all three dates on their slates, and then added them up, and reduced the answer to shillings and pence.”
—Lewis Carroll [Charles Lutwidge Dodgson] (1832–1898)
“I think middle-age is the best time, if we can escape the fatty degeneration of the conscience which often sets in at about fifty.”
—W.R. (William Ralph)