This preview shows pages 1–4. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CSC 165 mixed quanti ers Danny Heap [email protected] http://www.cdf.toronto.edu/ f heap/165/F10/ slide 1 recall: tabulating truth The standard venn diagram for 3 sets has 2 3 regions  one region for each possible combination of truth values for its component sets. We can get the same e ect with a rectangular diagram, or table: P Q R Q ) R P ) ( Q ) R ) T T T T T T T F F F T F T T T T F F T T F T T T T F T F F T F F T T T F F F T T As an exercise, compare this to the table for ( P ^ Q ) ) R . What do you conclude? slide 2 tautology, satis ability, unsatis ability You may have been unsettled in the previous slides that there were no domains stated for P; Q , or R , no de nitions for them, and nothing about what arguments (if any) these predicates take. The reason this was okay was that we considered all 8 possible truth values for P; Q , and R  all possible logical \worlds" that matter in their case....
View
Full
Document
This note was uploaded on 10/13/2011 for the course COMPUTER S CSC 165 taught by Professor Dannyheap during the Fall '10 term at University of Toronto.
 Fall '10
 DannyHeap
 Computer Science

Click to edit the document details