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: SOME PROBLEMS: chapters 5,6 Reminder: We define H semantics operations and as follows a b = max { a,b } , a b = min { a,b } . The Truth Tables for Implication and Nega tion are: HImplication F T F T T T F T T T F T H Negation F T T F F 1 QUESTION 1 We know that v : V AR { F, ,T } is such that v * (( a b ) ( a c )) = under H semantics. evaluate v * ((( b a ) ( a c )) ( a b )). 2 Solution : v * (( a b ) ( a c )) = under H semantics if and only if (we use shorthand notation) ( a b ) = T and ( a c ) = if and only if a = T,b = T and ( T c ) = if and only i f c = . I.e. we have that v * (( a b ) ( a c )) = iff a = T, b = T,c = . Now we can we evaluate v * ((( b a ) ( a c )) ( a b )) as follows (in short hand notation). v * ((( b a ) ( a c )) ( a b )) = ((( T T ) ( T )) ( T T )) = (( T ( T F )) T ) = T ....
View
Full
Document
This note was uploaded on 02/12/2011 for the course CSE 541 taught by Professor Bachmair,l during the Spring '08 term at SUNY Stony Brook.
 Spring '08
 Bachmair,L
 Computer Science

Click to edit the document details