CSE 16 Study Guide - Midterm Guide: Modus Ponens, Dn2, Algebraic Number Theory
Document Summary
Give the english translation and the truth table: P xnor q or (p-->q) ^(q-->p) or (~p v q) ^ (~q v p) Any theorem or identity remains true if the: Make every f of 1 false: what is sop/cnf vs. |{1,2,3,3,3,3}| = : how can you tell if something is countable, for s:{1,2,3} and t:{1,2,3,4,5} What would be the power set of a:{1,2,3,3,{},a,c}: set theoretic operations: A xnor b = : what are the precedence of. If the set is countable, then the set has a one-to-one correspondance. Corresponds to ((~pvr)^(pvq))->(qvr: what is resolution, solve this proof by contradiction: H --> c h ^ ~c --> f where (p-->q)^(s-->q)^(~s-->p)-- A x b = {(1,a),(1,b),(2,a),(2,b)} what is a x b = : what is a one-to- Where each value of a only maps onto one value of b: what is an.
