Scribd
Upload
18 views2 pages

Bilgisayar Bilimlerinde Ayrik Yapilar Ödev 2 Fannisa Firdaus - 1180505624

Uploaded by

Reza Dysta Satria

The document is a homework assignment in computer science that contains 16 truth tables analyzing different logical expressions and connectives. Each truth table tests the output of a logical expression for all possible combinations of true and false values for its variables. The expressions analyzed include: (q → (¬t → (¬s ∧ r))), (p → q) and (¬q → ¬p), ((p → q) ∧ (q → r)) and (p ∨ q) → r and (p ∧ q) ⇔ r, and (p → r) ∧ (p → q) and p → (q ∨ r).

Copyright:

© All Rights Reserved
Download as DOCX, PDF, TXT or read online from Scribd
Download as docx, pdf, or txt

Bilgisayar Bilimlerinde Ayrik Yapilar Ödev 2 Fannisa Firdaus - 1180505624

Uploaded by

Reza Dysta Satria
18 views2 pages
The document is a homework assignment in computer science that contains 16 truth tables analyzing different logical expressions and connectives. Each truth table tests the output of a logical expression for all possible combinations of true and false values for its variables. The expressions analyzed include: (q → (¬t → (¬s ∧ r))), (p → q) and (¬q → ¬p), ((p → q) ∧ (q → r)) and (p ∨ q) → r and (p ∧ q) ⇔ r, and (p → r) ∧ (p → q) and p → (q ∨ r).

Original Title

odev2

Copyright

© © All Rights Reserved

Available Formats

DOCX, PDF, TXT or read online from Scribd

Did you find this document useful?

Is this content inappropriate?

The document is a homework assignment in computer science that contains 16 truth tables analyzing different logical expressions and connectives. Each truth table tests the output of a logical expression for all possible combinations of true and false values for its variables. The expressions analyzed include: (q → (¬t → (¬s ∧ r))), (p → q) and (¬q → ¬p), ((p → q) ∧ (q → r)) and (p ∨ q) → r and (p ∧ q) ⇔ r, and (p → r) ∧ (p → q) and p → (q ∨ r).

Copyright:

© All Rights Reserved
Download as DOCX, PDF, TXT or read online from Scribd
Download as docx, pdf, or txt
18 views2 pages

Bilgisayar Bilimlerinde Ayrik Yapilar Ödev 2 Fannisa Firdaus - 1180505624

Uploaded by

Reza Dysta Satria
The document is a homework assignment in computer science that contains 16 truth tables analyzing different logical expressions and connectives. Each truth table tests the output of a logical expression for all possible combinations of true and false values for its variables. The expressions analyzed include: (q → (¬t → (¬s ∧ r))), (p → q) and (¬q → ¬p), ((p → q) ∧ (q → r)) and (p ∨ q) → r and (p ∧ q) ⇔ r, and (p → r) ∧ (p → q) and p → (q ∨ r).

Copyright:

© All Rights Reserved
Download as DOCX, PDF, TXT or read online from Scribd
Download as docx, pdf, or txt
You are on page 1/ 2

Bilgisayar Bilimlerinde Ayrik Yapilar

Ödev 2

Fannisa Firdaus - 1180505624

q → (¬t → (¬s ∧ r))

q t s r ¬s  ¬t (¬s ∧ r) (¬t → (¬s ∧ r)) (q → (¬t → (¬s ∧ r)))


0 0 0 0 1 1 0 0 1
0 0 0 1 1 1 1 1 1
0 0 1 0 0 1 0 0 1
0 1 0 0 1 0 0 1 1
1 0 0 0 1 1 0 0 0
1 1 0 0 1 0 0 1 1
0 1 1 0 0 0 0 1 1
0 0 1 1 0 1 0 0 1
0 1 1 1 0 0 0 1 1
1 1 1 0 0 0 0 1 1
1 0 0 1 1 1 1 1 1
1 0 1 0 0 1 0 0 0
0 1 0 1 1 0 1 1 1
1 0 1 1 0 1 0 0 0
1 1 0 1 1 0 1 1 1
1 1 1 1 0 0 0 1 1

(p → q) ve (¬q → ¬p)

p q ¬q  ¬p (p → q)  (¬q → ¬p)


0 0 1 1 1 1
0 1 0 1 1 1
1 0 1 0 0 0
1 1 0 0 1 1

(p →  q) ∧ (q → r) ve (p ∨ q) → r ve (p ∧ q) ⇔ r

p q r (p →  q) (q → r) ((p →  q) ∧ (q → r)) (p ∨ q) r ((p ∨ q) → r )) (p ∧ q)  r ((p ∧ q) ⇔ r))


0 0 0 1 1 1 0 0 1 0 0 1
0 0 1 1 1 1 0 1 1 0 1 0
0 1 0 1 0 0 1 0 0 0 0 1
1 0 0 0 1 0 1 0 0 0 0 1
1 1 0 1 0 0 1 0 0 1 0 0
0 1 1 1 1 1 1 1 1 0 1 0
1 0 1 0 1 0 1 1 1 0 1 0
1 1 1 1 1 1 1 1 1 1 1 1
(p → r) ∧ (p → q) ve p → (q ∨ r)
p q r (p → r)  (p → q)  ((p → r) ∧ (p → q))  p (q ∨ r) (p → (q ∨ r))
0 0 0 1 1 1 0 0 1
0 0 1 1 1 1 0 1 1
0 1 0 1 1 1 0 1 1
1 0 0 0 0 0 1 0 0
0 1 1 1 1 1 0 1 1
1 1 0 0 1 0 1 1 1
1 0 1 1 0 0 1 1 1
1 1 1 1 1 1 1 1 1

You might also like