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 physicians say, they are not materialists; but they are:MSpirit is matter reduced to an extreme thinness: O so thin!—But the definition of spiritual should be, that which is its own evidence. What notions do they attach to love! what to religion! One would not willingly pronounce these words in their hearing, and give them the occasion to profane them.”
—Ralph Waldo Emerson (1803–1882)
“To me this world is all one continued vision of fancy or imagination, and I feel flattered when I am told so. What is it sets Homer, Virgil and Milton in so high a rank of art? Why is Bible more entertaining and instructive than any other book? Is it not because they are addressed to the imagination, which is spiritual sensation, and but mediately to the understanding or reason?”
—William Blake (1757–1827)