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.

2017

Let $G=(V,E)$ be a finite undirected graph and let $R, S\subseteq V$. If $P$ and $Q$ are disjoint oriented paths in $G$, with $P…

2015

2009

We discuss a theoretical design of an arithmetical chip built on an excitable medium substrate. The chip is simulated in a two…

2008

2006

Practical wall climbing robots that are used for applications requiring them to be fitted with task specific tools should be…

2002

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

2002

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

1980

A three-valued truth function is a function from {T, I, F] to {Γ, /, F}. We define a Lukasiewiczian function as a three-valued…

1978

This paper addresses the problem of protocol failures that are caused by logically incompletely specified designs. A design is…

1963

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