functionally complete
Look at other dictionaries:
List of NP-complete problems — Here are some of the more commonly known problems that are NP complete when expressed as decision problems. This list is in no way comprehensive (there are more than 3000 known NP complete problems). Most of the problems in this list are taken… … Wikipedia
Turing complete — adjective Equivalent in power to a universal Turing machine; equivalently, functionally complete. See Also: Turing machine, universal Turing machine … Wiktionary
Functional completeness — 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.[1][2] A well known complete set of… … Wikipedia
Logical connective — This article is about connectives in classical logic. For connectors in natural languages, see discourse connective. For connectives and operators in other logics, see logical constant. For other logical symbols, see table of logic symbols. In… … Wikipedia
Sheffer stroke — This article is about the logical NAND operator. For the electronic NAND gate, see Negated AND gate. For other uses, see Nand (disambiguation). Venn diagram of In Boolean functions and propositional calculus, the Sheffer stroke, named after … Wikipedia
Post's lattice — In logic and universal algebra, Post s lattice denotes the lattice of all clones on a two element set {0, 1}, ordered by inclusion. It is named for Emil Post, who published a complete description of the lattice in 1941 [E. L. Post, The two valued … Wikipedia
Predicate functor logic — In mathematical logic, predicate functor logic (PFL) is one of several ways to express first order logic (formerly known as predicate logic) by purely algebraic means, i.e., without quantified variables. PFL employs a small number of algebraic… … Wikipedia
Logical NOR — This article is about NOR in the logical sense. For the electronic gate, see NOR gate. For other uses, see Nor. Venn diagram of In boolean logic, logical nor or joint denial is a truth functional operator which produces a result that is the… … Wikipedia
Completeness — In general, an object is complete if nothing needs to be added to it. This notion is made more specific in various fields. Contents 1 Logical completeness 2 Mathematical completeness 3 Computing 4 … Wikipedia
Conditioned disjunction — In logic, conditioned disjunction (sometimes called conditional disjunction) is a ternary logical connective introduced by Church.[1]. Given operands p, q, and r, which represent truth valued propositions, the meaning of the conditioned… … Wikipedia
