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:
“The Gettysburg speech is at once the shortest and the most famous oration in American history. Put beside it, all the whoopings of the Websters, Sumners and Everetts seem gaudy and silly. It is eloquence brought to a pellucid and almost gem-like perfection—the highest emotion reduced to a few poetical phrases.”
—H.L. (Henry Lewis)
“The poem has a social effect of some kind whether or not the poet wills it to have. It has kinetic force, it sets in motion ... [ellipsis in source] elements in the reader that would otherwise be stagnant.”
—Denise Levertov (b. 1923)