作者ray02825 (面包)
看板Grad-ProbAsk
标题[理工] [离散]-逻辑
时间Tue Nov 3 21:24:01 2009
A set {bi} of two-valued boolean functions is said to be complete
if every two-valued boolean function can be expressed by a boolean
expreesion using only bi's. Define boolean functions → and ⊥
as follow：
a→b≡ ﹁a ˇb
a⊥b≡ F 对於所有的a，b
Which of the following set is not complete?
A. {﹁,ˇ}
B. {⊥,→}
C. {﹁,→}
D. {︿,→}
请问各位大大这题该怎麽做？ 谢谢
--
※ 发信站: 批踢踢实业坊(ptt.cc)
◆ From: 122.125.163.120