CS 2305 Lecture 3: CS 2305 Lecture 3
5 Oct 2018
School
Department
Course
Professor
Document Summary
Ex show that cp q cpvq is a tautology. C p v q v pua spurs v gav q. Ae pj p n r n is satisfiable yes vph n pn r n r v p n p q v r n pv q v r satisfiable no try all 8 possibilities t convince selfthatthis isn"t satisfiable. Quantifier i f k f thereis one d there forevery andonlyone exists fora unique thereis at least one d. X o domain of is integers c a tot a. Pc3 false pc false p x y z. Pc3 true domain of x y z are integers p 2 i s false p 34,7 true. Pc3 pc1 true plz a pc 1 false. Plx s pcx true for all in the domain. Pg xso u is integers some in the domain in the domain. P x txpcx false x11 0 u is integers. Vxp x vqcd correct vxcp. ch qcxd txpg vqcx.
