This preview shows pages 1–8. 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 DocumentThis 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: Propositional Logic This is the foolproof way of determining the truthvalue of most compound statements. The key is to know the truth tables for the 5 logical operators. Translate into Symbolic Form 1. Passing the w ritten exam is not a sufficient condition for g etting a driving license. 2. Passing the w ritten exam and the r oad exam is a necessary and sufficient condition for g etting a driving license. 3. If T om gives me the money, then if M ary is willing to sell me the MDplayer, then my b uying the MDplayer implies that I will have e nough money left for the school fee. 4. E arning a degree is a sufficient condition for making my parents h appy only if the j ob market is optimistic when I graduate. Which is a WFF? 1. (F ~Q) (A E v T) 2. (R S T) ~(~W ~X) 3. (A ~T) ~(~D G) Identify main operator F ((G J) (~I v B)) (A C) v ~(R ~(D v H)) F ((G J) (~I v B)) (A C) v ~(R ~(D v H)) Determine the truthvalues of compound...
View
Full
Document
This note was uploaded on 11/26/2011 for the course COMPUTER S 1003 taught by Professor Angelosstavrou during the Spring '11 term at King Saud University.
 Spring '11
 AngelosStavrou

Click to edit the document details