= Functional completeness
{wiki=Functional_completeness}
Functional completeness is a concept in the field of mathematics and computer science, particularly in the study of logic and formal systems. It refers to a set of functions or operations that can be combined to express all possible functions within a given context or structure. In the context of logic, a set of logical connectives (like AND, OR, NOT) is said to be functionally complete if any possible logical expression can be formed using only those connectives.
Back to article page