Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

23 relations

Broader (3)

Boolean algebraLogic in computer sciencePropositional calculus
Boolean expressionCircuit satisfiability problemDigital electronicsFredkin gate
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Compressive sensing over graphs
In this paper, motivated by network inference and tomography applications, we study the problem of compressive sensing for sparse… Expand
  • figure 1
  • table I
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Characterization of sub-Gaussian heat kernel estimates on strongly recurrent graphs
Sub-Gaussian estimates for random walks are typical of fractal graphs. We characterize them in the strongly recurrent case, in… Expand
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Bootstrapping locality-aware P2P networks
Bootstrapping is a vital core functionality required by every peer-to-peer (P2P) overlay network. Nodes intending to participate… Expand
  • figure 1
  • figure 2
  • figure 4
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Distributed algorithms for transmission power control in wireless sensor networks
In a wireless, multi-hop sensor network, choosing transmission power levels has an important impact on energy efficiency and… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1998
1998
Functional Completeness of Hierarchical Fuzzy Modeling
Abstract Department of Electrical Engineering, Tokai University, 1117 Kitakaname, Hiratsuka, Kanagawa 259-1292, Japan A… Expand
Is this relevant?
Highly Cited
1996
Highly Cited
1996
On the Expressive Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order Logic
Monadic second order logic (MSOL) over transition systems is considered. It is shown that every formula of MSOL which does not… Expand
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Sémantique pour l'analyse : de la linguistique à l'informatique
Sfmantique pour l'analyse de la linguistique ?z l'informatique is a thoughtful and insightful discussion of difficult issues in… Expand
Is this relevant?
1990
1990
A Category-Theoretic Characterization of Functional Completeness
Abstract Functional languages are based on the notion of application: programs may be applied to data or programs. By application… Expand
Is this relevant?
1986
1986
Important issues in knowledge representation
  • W.A. Woods
  • Proceedings of the IEEE
  • 1986
    • Corpus ID: 7363835
This paper discusses a number of important issues that drive knowledge representation research. It begins by considering the… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1981
Highly Cited
1981
EXPRESSIVE FUNCTIONAL COMPLETENESS IN TENSE LOGIC
Consider a partially ordered set(T <,=), where T is non-empty,< is an irreflexive and transitive relation on T and = is equality… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE