Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 236,979,882 papers from all fields of science
Search
Sign In
Create Free Account
Functional completeness
Known as:
Adequacy (logic)
, Complete set of Boolean operators
, Sole sufficient operator
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
23 relations
Broader (3)
Boolean algebra
Logic in computer science
Propositional calculus
Boolean expression
Circuit satisfiability problem
Digital electronics
Fredkin gate
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
The space of ends of pairs of disjoint paths
Guantao Chen
,
Sergey Norin
,
R. Thomas
,
H. Holst
2017
Corpus ID: 126064018
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…
Expand
2017
2017
A Relic of the Past or the Future of Environmental Criminal Law? An Argument for a Broad Interpretation of Liability under the Migratory Bird Treaty Act
Emma Hamilton
2017
Corpus ID: 135056527
2015
2015
Stream of Consciousness: Poetics of the Universal
P. Vakunta
2015
Corpus ID: 170403007
2009
2009
Towards Arithmetical Chips in Sub-Excitable Media: Cellular Automaton Models
L. Zhang
,
A. Adamatzky
International Journal of Nanotechnology and…
2009
Corpus ID: 36216120
We discuss a theoretical design of an arithmetical chip built on an excitable medium substrate. The chip is simulated in a two…
Expand
2008
2008
ANALOGY OF AQUINAS AND ITS COMPARISON TO GRADED UNIVERSAL
Tawakkuli Ghulam Husayn
2008
Corpus ID: 124571844
2006
2006
DISTRIBUTED MECHATRONICS CONTROLLER FOR MODULAR WALL CLIMBING ROBOT
N. Tlale
,
G. Bright
2006
Corpus ID: 16611529
Practical wall climbing robots that are used for applications requiring them to be fitted with task specific tools should be…
Expand
2002
2002
Non-Silicon Non-Binary Computing : Why not ?
E. Dubrova
,
Y. Jamal
,
J. Mathew
,
Dymanic Ram Dram
2002
Corpus ID: 1478513
Non-silicon based computing technologies open new possibilities for designing electronic circuits which employ more than two…
Expand
1980
1980
Functional completeness and non-Łukasiewiczian truth functions
Herbert E. Hendry
Notre Dame J. Formal Log.
1980
Corpus ID: 31039021
A three-valued truth function is a function from {T, I, F] to {Γ, /, F}. We define a Lukasiewiczian function as a three-valued…
Expand
1978
1978
Design rules for producing logically complete two-process interactions and communications protocols
P. Zafiropulo
Annual International Computer Software and…
1978
Corpus ID: 12614610
This paper addresses the problem of protocol failures that are caused by logically incompletely specified designs. A design is…
Expand
1963
1963
Design of ACP Resistor-Coupled Switching Circuits
D. Chung
,
John A. Palmieri
IBM Journal of Research and Development
1963
Corpus ID: 5286117
Directly coupled logic circuits utilizing silicon transistors have been developed in the Advanced Circuit Program. Silicon…
Expand