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:
“There surely is a being who presides over the universe; and who, with infinite wisdom and power, has reduced the jarring elements into just order and proportion. Let speculative reasoners dispute, how far this beneficent being extends his care, and whether he prolongs our existence beyond the grave, in order to bestow on virtue its just reward, and render it fully triumphant.”
—David Hume (1711–1776)
“Music sets up ladders,
it makes us invisible,
it sets us apart,
it lets us escape;
but from the visible
there is no escape.”
—Hilda Doolittle (1886–1961)