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:
“Realism, whether it be socialist or not, falls short of reality. It shrinks it, attenuates it, falsifies it; it does not take into account our basic truths and our fundamental obsessions: love, death, astonishment. It presents man in a reduced and estranged perspective. Truth is in our dreams, in the imagination.”
—Eugène Ionesco (b. 1912)
“It is time to be old,
To take in sail:—
The god of bounds,
Who sets to seas a shore,
Came to me in his fatal rounds,
And said: ‘No more!’”
—Ralph Waldo Emerson (1803–1882)