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:
“I’ve tried to reduce profanity but I reduced so much profanity when writing the book that I’m afraid not much could come out. Perhaps we will have to consider it simply as a profane book and hope that the next book will be less profane or perhaps more sacred.”
—Ernest Hemingway (1899–1961)
“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)