Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03320585n
Noun Concept
Categories: Charles Sanders Peirce, Propositional calculus, Boolean algebra, Logic in computer science
EN
functional completeness  Adequacy  Complete set of Boolean operators  Expressive adequacy  functionally complete
EN
In logic, a functionally complete set of logical connectives or Boolean operators is one which can be used to express all possible truth tables by combining members of the set into a Boolean expression. Wikipedia
Definitions
Relations
Sources
EN
In logic, a functionally complete set of logical connectives or Boolean operators is one which can be used to express all possible truth tables by combining members of the set into a Boolean expression. Wikipedia
IS A
property
DESCRIBED BY SOURCE
Armenian Soviet Encyclopedia
Wikipedia
EN
functional completeness
Wikidata
EN
functional completeness
Wikipedia Redirections
EN
Adequacy (logic), Complete set of Boolean operators, Expressive adequacy, functionally complete, Post's criterion, Post's functional completeness theorem, sole sufficient operator, Sufficiently connected
Wikidata Alias
EN
functionally complete

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License