[理工] [離散]-邏輯
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
討論串 (同標題文章)