5,6exampleslide

5,6exampleslide - SOME PROBLEMS: chapters 5,6 Reminder: We...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the 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: H-Implication 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.

Page1 / 13

5,6exampleslide - SOME PROBLEMS: chapters 5,6 Reminder: We...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online