EECS 203 chapter 1 summary * Proposition = Statement that's true or false * Propositional variable = Variable representing a proposition * Truth value = Either true or false * ¬p = Negation of p * Compound proposition = Proposition constructed by combining propositions using logical operators * p ^ q = Conjunction; AND * p V q = Disjunction; OR * p XOR q = Exclusive or; XOR; only one can be true * p -> q = If p then q * Converse of p -> q = q -> p * Contrapositive of p -> q = ¬q -> ¬p * Inverse of p -> q = ¬p -> ¬q * p <-> q = Biconditional; p if and only if q * Bitwise operations = operations on strings of bits that operate on each bit in one string and the corresponding bit in the other string * Tautology = Preposition that's always true * Contradiction = Preposition that's always false * Contingency = Not a tautology nor contradiction * ∀ = all of x in domain is true * ∃ = at least one x in domain is true