Functional completeness

From Wikipedia, the free encyclopedia

In logic, a set of logical connectives is functionally complete if all other possible connectives can be defined in terms of it.

Usually, in an exposition of classical logic, the following connectives are defined: conjunction (\land), disjunction (\lor), negation (\neg), implication (\to) and possibly bi-implication (\leftrightarrow). This constitutes a functionally complete set. However, it is not a minimal functionally complete set, as implication and bi-implication may be defined as:

A \to B := \neg A \lor B
A \leftrightarrow B := (A \to B) \land (B \to A)

So {\neg, \land, \lor} is also functionally complete. But then, \lor can be defined as:

A \lor B := \neg(\neg A \land \neg B)

(\land can also be defined in terms of \lor in a similar manner.)

This cannot be further simplified, so {\neg, \land} (and {\neg, \lor}) are each minimal functionally complete subsets of {\neg, \land, \lor, \to, \leftrightarrow}. Moreover, the binary connectives NOR and NAND are functionally complete on their own, and are called sole sufficient operators.

Advanced Search
Included Web Search Engines


Safe Search

close

Top Matching Results

Occasionally Search.com will highlight specialized results that are based on the context of your query. Examples of specialized results include specific links to news, images, or video.

Top Matching Results may highlight information from other Search.com pages, content from the CNET Network of sites, or third party content. The listings are based purely on relevance. Search.com does not receive payment for listings in this section but our partners that provide this data may get paid for listing these products.

Sponsored Links

This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.

Search Results

Search.com sends your search query to several search engines at one time and integrates the results into one list which has been sorted by relevance using Search.com's proprietary algorithm. You can customize the list of search engines included in your metasearch from the preferences.

The search engines that are used in your metasearch may allow companies to pay to have their Web sites included within the results. To view the Paid Inclusion policy for a specific search engine, please visit their Web site. Search.com does not accept payment or share revenue with any search engine partner for listings in this section.