# Category:Functional Completeness

Jump to navigation
Jump to search

This category contains results about Functional Completeness.

Let $S$ be a set of truth functions.

Then $S$ is **functionally complete** if and only if all possible truth functions are definable from $S$.

## Pages in category "Functional Completeness"

The following 15 pages are in this category, out of 15 total.

### F

- Functionally Complete Logical Connectives
- Functionally Complete Logical Connectives/Conjunction, Negation and Disjunction
- Functionally Complete Logical Connectives/NAND
- Functionally Complete Logical Connectives/Negation and Conditional
- Functionally Complete Logical Connectives/Negation and Conjunction
- Functionally Complete Logical Connectives/Negation and Disjunction
- Functionally Complete Logical Connectives/Negation, Conjunction, Disjunction and Implication
- Functionally Complete Logical Connectives/NOR
- Functionally Complete Singleton Sets
- Functionally Incomplete Logical Connectives
- Functionally Incomplete Logical Connectives/Conjunction and Disjunction
- Functionally Incomplete Logical Connectives/Negation and Biconditional