[問題] 請問離散的邏輯

看板Grad-ProbAsk作者 (小二)時間17年前 (2009/03/23 18:43), 編輯推噓4(407)
留言11則, 4人參與, 最新討論串1/4 (看更多)
1.Simplify the expressions to equivalent statements that have as few symbols as possible (1) ( p ^ ( p v q ) ) v q (2) ┐( ┐( p v r ) v ┐( p v q )) 答案 (1) p v q (2) p v ( r ^ q ) 請問該如何推導 感謝回答 -- ※ 發信站: 批踢踢實業坊(ptt.cc) ◆ From: 118.168.39.77

03/23 19:49, , 1F
q v (q ^ p)?
03/23 19:49, 1F

03/23 19:55, , 2F
你是說哪一題 答案好像不是這樣
03/23 19:55, 2F

03/23 21:00, , 3F
P v q
03/23 21:00, 3F

03/23 21:03, , 4F
P v q v R
03/23 21:03, 4F

03/23 21:04, , 5F
第二個是P
03/23 21:04, 5F
※ 編輯: billwang 來自: 118.168.39.77 (03/23 21:09)

03/23 22:05, , 6F
這個用畫圖的 就能推了
03/23 22:05, 6F

03/23 22:31, , 7F
1.[p v(p ^ q)] v q = p v q
03/23 22:31, 7F

03/23 22:32, , 8F
2. (p v r) ^ (p v q) = p v (r ^ q)
03/23 22:32, 8F

03/23 22:41, , 9F
請問樓上高手要如何推導
03/23 22:41, 9F

03/24 11:05, , 10F
使用K-map吧!?
03/24 11:05, 10F

03/24 11:07, , 11F
更正...使用Boolean的基本性質就可以了= =+
03/24 11:07, 11F
文章代碼(AID): #19nsVfed (Grad-ProbAsk)
文章代碼(AID): #19nsVfed (Grad-ProbAsk)