CSE 215 Lecture Notes - Lecture 4: Truth Table

• School: Stony Brook University
• Department: Computer Science
• Course: CSE 215
• Professor: Gupta

Document Summary

We can show that (x ^ y) -> z is always true (a tautology). B says: a and b are of opposite types. For statement 1, x -> y. (if x is a knight, then y is also a knight) (knights always tell the truth) For statement 1, ~x -> ~y (if x is not a knight, then y is not a knight) (knaves lie) Combine two above statements: (x -> y) and (~x -> y) For statement 2, (y -> ~(x==y)) and (~y -> (x==y)) (if they are the same types or not) Bob is majoring in both math and cs and ann is majoring in math but ann is not majoring in both math and cs. It is not the case that both bob and ann are majoring in both math and cs, but it is the case that. Ann is majoring in math and bob in both math and cs.