This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: (all interpretations are models), inconsistent (no interpretation is a model) or satisfiable (at least one intrpretation is a model). Note: Model of a formula G is an interpretation in which G is true. Problem 4: Assume same encoding as problem 3: F1: (P => (not Q => (R and S)) F2: P F3: not Q F4: not R theorem to prove: S Show that S is a logical consequence of formulas F1, F2, F3 and F4. To do this either show that (F1 and F2 and F3 and F4) => G is a tautology or show that F1 and F2 and F3 and F4 and not G is inconsistent or show that every model of F1 and F2 and F3 and F4 is a model of G. Problem 5: G = Tom is a good student P = Tom's father supports him S = Tom is smart F1: G => (P and S) F2: G => P Show F1 => F2 is a valid formula (i.e., it is a tautology)...
View
Full
Document
This note was uploaded on 12/12/2009 for the course SE 3306 taught by Professor Nhut during the Spring '09 term at University of Texas at Dallas, Richardson.
 Spring '09
 Nhut

Click to edit the document details