自足算子
Sign in to saveAlso known as functionally complete
property of a set of logical connectives which can express all possible truth tables by combining members of the set
In the Vinony graph
Within Vinony's link graph, 自足算子 is referenced by 87 other articles, and connects out to semantic theory of truth, mathematical logic and logic gate.
Vinony files it under Boolean algebra, Charles Sanders Peirce and Logic in computer science.
Its subject is documented across 10 Wikipedia language editions.
Article · 中文
自足算子或自足连结词是在一特定类的算子中只靠自身就能生成所有这些算子的算子。在逻辑中，它是足够生成所有布尔值函数的一个逻辑算子，，这里的 是一个任意集合而 是一个通用的 2-元素集合，典型为 ，特别是生成所有的有限布尔函数，。
Abstract from DBpedia / Wikipedia · CC BY-SA
Connections
semantic theory of truth
Entity
mathematical logic
Entity
logic gate
Entity
propositional calculus
Entity
Russell's paradox
Entity
first-order logic
Entity
formal system
Entity
recursive set
Entity
Boolean algebra
Entity
quantum gate
Entity
Sheffer stroke
Entity
semantics of logic
Entity
structure
Entity
ground expression
Entity
diagram
Entity
logic
Entity
International Standard Book Number
Entity
programming language
Entity
set theory
Entity
function
Entity