Functional completeness

Known as: Adequacy (logic), Complete set of Boolean operators, Sole sufficient operator

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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2011

The quantum-dot cellular automata (QCA) computing architecture has been proposed to not only offer scalability to the molecular…

2006

The paper is devoted to the theory of clones which is a promising approach to the challenge of program design automation in the…

2002

Non-silicon based computing technologies open new possibilities for designing electronic circuits which employ more than two…

2002

Data structures for direct and parametric representation of schedules are considered and corresponding systems of operations for…

1999

The Supplementary Symmetrical Logic Circuit Structure (SUS-LOC) is a fully active, self sustaining architecture intended…

1996

1995

Many proofs of functional completeness for intuitionistic propositional logic and related systems make use of a higher-level…

1994

By way of introduction I want first to distinguish between several types of pluralism; then I want to consider more closely the…

1993

1963

Directly coupled logic circuits utilizing silicon transistors have been developed in the Advanced Circuit Program. Silicon…