ÿþ<?xml version="1.0" encoding="UTF-16"?>
<Presentation>
<pptaddin>Articulate Presenter version 6 Pro,build10</pptaddin>
<Filename>C:\Documents and Settings\hargisr\My Documents\MAT120\ppt\unit2\modified\002_Logic-CompoundPropositions2_000.ppt</Filename>
<LmsProperties>
<protocol>
<method/>
<version/>
</protocol>
<completion>
<method/>
<threshold/>
<target/>
</completion>
</LmsProperties>
<BuiltinProperties>
<Title><![CDATA[Logic Lesson2: Compound Propositions]]></Title>
<BasePath>002_Logic-CompoundPropositions2_000</BasePath>
<PresenterName><![CDATA[]]></PresenterName>
<PresenterTitle><![CDATA[]]></PresenterTitle>
<PresenterCompany><![CDATA[]]></PresenterCompany>
<PresenterEmail><![CDATA[]]></PresenterEmail>
<PresenterBio><![CDATA[]]></PresenterBio>
<PresenterPhoto/>
</BuiltinProperties>
<References>
<Doc>
<Title><![CDATA[Printer-Friendly Version of this Presentation]]></Title>
<Type>file</Type>
<Data><![CDATA[002_logic-compoundpropositions2_000.pdf]]></Data>
</Doc>
</References>
<Slides>
<Slide id="df5692ea-91ff-4237-b13f-554346f91fd6">
<Filename>slide1.swf</Filename>
<BackgroundFile>bgd1l1.swf</BackgroundFile>
<Title><![CDATA[Compound Propositions]]></Title>
<Notes><![CDATA[Text Chapter 3   Sections 1, 2]]></Notes>
<notesswfbig>notes/notesbig1.swf</notesswfbig>
<NotesHeightBig>22</NotesHeightBig>
<notesswfsmall>notes/notessmall1.swf</notesswfsmall>
<NotesHeightSmall>22</NotesHeightSmall>
<SlideTime>90</SlideTime>
<waitforuser>false</waitforuser>
<Hidden>false</Hidden>
<navlocked>false</navlocked>
<branch>
<prev>default</prev>
<next>default</next>
</branch>
<DisplayMode></DisplayMode>
<level>0</level>
<PlayListId>-1</PlayListId>
<annotations>
</annotations>
<SlideText><![CDATA[Compound Propositions Conjunction, Disjunction, Conditional and Bi-conditional Text Chapter 3   Sections 1, 2 ]]></SlideText>
<framerate>30</framerate>
</Slide>
<Slide id="e3cc9144-02be-4e21-b8e9-78e0269ea7f0">
<Filename>slide2.swf</Filename>
<BackgroundFile>bgd1l2.swf</BackgroundFile>
<Title><![CDATA[Conjunction]]></Title>
<Notes><![CDATA[No in-class assignment problem]]></Notes>
<notesswfbig>notes/notesbig2.swf</notesswfbig>
<NotesHeightBig>22</NotesHeightBig>
<notesswfsmall>notes/notessmall2.swf</notesswfsmall>
<NotesHeightSmall>22</NotesHeightSmall>
<SlideTime>90</SlideTime>
<waitforuser>false</waitforuser>
<Hidden>false</Hidden>
<navlocked>false</navlocked>
<branch>
<prev>default</prev>
<next>default</next>
</branch>
<DisplayMode></DisplayMode>
<level>0</level>
<PlayListId>-1</PlayListId>
<annotations>
</annotations>
<SlideText><![CDATA[Conjunction A conjunction is a compound proposition which consists of two propositions joined by the connective  and  (but, however, also).  Denoted p     q. 9 is divisible by 3 and 4 is an odd number. 2 + 5 = 10 but 16 is a multiple of 3. A proposition is either true or false.  It cannot be both.   So under what conditions is a conjunction true? No in-class assignment problem ]]></SlideText>
<framerate>30</framerate>
</Slide>
<Slide id="2fcad1ae-8018-47b0-9054-0a1f394effed">
<Filename>slide3.swf</Filename>
<BackgroundFile>bgd1l2.swf</BackgroundFile>
<Title><![CDATA[Truth Values for ConjunctionsYou decide!]]></Title>
<Notes><![CDATA[In-class Assignment 9 - 1]]></Notes>
<notesswfbig>notes/notesbig3.swf</notesswfbig>
<NotesHeightBig>22</NotesHeightBig>
<notesswfsmall>notes/notessmall3.swf</notesswfsmall>
<NotesHeightSmall>22</NotesHeightSmall>
<SlideTime>90</SlideTime>
<waitforuser>false</waitforuser>
<Hidden>false</Hidden>
<navlocked>false</navlocked>
<branch>
<prev>default</prev>
<next>default</next>
</branch>
<DisplayMode></DisplayMode>
<level>0</level>
<PlayListId>-1</PlayListId>
<annotations>
</annotations>
<SlideText><![CDATA[Truth Values for Conjunctions You decide! Stryket Rich won a TV set and $1000. He was overheard telling about his winnings to 4 people.  Decide to whom he told the truth. Jane:  I won a TV and $1000. John: I won a TV and a video camera. Ed:  I won a car and $1000.  Mary:  I won a car and a video camera. In-class Assignment 9 - 1 ]]></SlideText>
<framerate>30</framerate>
</Slide>
<Slide id="96e1c679-d897-4d5f-8af3-0103824289d3">
<Filename>slide4.swf</Filename>
<BackgroundFile>bgd1l12.swf</BackgroundFile>
<Title><![CDATA[Truth Table for Conjunctions]]></Title>
<Notes><![CDATA[In-class Assignment 9 - 1]]></Notes>
<notesswfbig>notes/notesbig4.swf</notesswfbig>
<NotesHeightBig>22</NotesHeightBig>
<notesswfsmall>notes/notessmall4.swf</notesswfsmall>
<NotesHeightSmall>22</NotesHeightSmall>
<SlideTime>90</SlideTime>
<waitforuser>false</waitforuser>
<Hidden>false</Hidden>
<navlocked>false</navlocked>
<branch>
<prev>default</prev>
<next>default</next>
</branch>
<DisplayMode></DisplayMode>
<level>0</level>
<PlayListId>-1</PlayListId>
<annotations>
</annotations>
<SlideText><![CDATA[Truth Table for Conjunctions Need a heading row and 4 more rows for each possible combination (condition) of true and false. Need a column for each proposition and one for the conjunction. A conjunction is true only if both propositions are true. In-class Assignment 9 - 1 ]]></SlideText>
<framerate>30</framerate>
</Slide>
<Slide id="137490cb-e920-4b18-add5-e624ecc449fb">
<Filename>slide5.swf</Filename>
<BackgroundFile>bgd1l2.swf</BackgroundFile>
<Title><![CDATA[Disjunction]]></Title>
<Notes><![CDATA[No in-class assignment problem]]></Notes>
<notesswfbig>notes/notesbig5.swf</notesswfbig>
<NotesHeightBig>22</NotesHeightBig>
<notesswfsmall>notes/notessmall5.swf</notesswfsmall>
<NotesHeightSmall>22</NotesHeightSmall>
<SlideTime>90</SlideTime>
<waitforuser>false</waitforuser>
<Hidden>false</Hidden>
<navlocked>false</navlocked>
<branch>
<prev>default</prev>
<next>default</next>
</branch>
<DisplayMode></DisplayMode>
<level>0</level>
<PlayListId>-1</PlayListId>
<annotations>
</annotations>
<SlideText><![CDATA[Disjunction A disjunction is a compound proposition which consists of 2 propositions joined by the connective  or.   Denoted p    q.  Or  has two meanings in our language.  Use the inclusive or which is the legal and/or type.  No in-class assignment problem ]]></SlideText>
<framerate>30</framerate>
</Slide>
<Slide id="95a5d00c-19e2-4504-938b-1f82bdda78a3">
<Filename>slide6.swf</Filename>
<BackgroundFile>bgd1l2.swf</BackgroundFile>
<Title><![CDATA[Truth Values of a DisjunctionYou Decide.]]></Title>
<Notes><![CDATA[In-class assignment 9 - 2]]></Notes>
<notesswfbig>notes/notesbig6.swf</notesswfbig>
<NotesHeightBig>22</NotesHeightBig>
<notesswfsmall>notes/notessmall6.swf</notesswfsmall>
<NotesHeightSmall>22</NotesHeightSmall>
<SlideTime>90</SlideTime>
<waitforuser>false</waitforuser>
<Hidden>false</Hidden>
<navlocked>false</navlocked>
<branch>
<prev>default</prev>
<next>default</next>
</branch>
<DisplayMode></DisplayMode>
<level>0</level>
<PlayListId>-1</PlayListId>
<annotations>
</annotations>
<SlideText><![CDATA[Truth Values of a Disjunction You Decide. John bragged that he could roll a 2 or a 5 when rolling a die twice. He rolled his die twice with the following results for 4 people. Ida:  He rolled a 2 and then a 5. Sean: He rolled a 2 and then a 6. Mary:  He rolled a 6 and then a 5. Harry:  He rolled a 6 and then a 4.   In which of the cases was John s brag true?   In-class assignment 9 - 2 ]]></SlideText>
<framerate>30</framerate>
</Slide>
<Slide id="eb71e277-764c-4df2-9a10-57b40cc49bc8">
<Filename>slide7.swf</Filename>
<BackgroundFile>bgd1l12.swf</BackgroundFile>
<Title><![CDATA[Truth Table for the Disjunction]]></Title>
<Notes><![CDATA[In-class Assignment 9 - 2]]></Notes>
<notesswfbig>notes/notesbig7.swf</notesswfbig>
<NotesHeightBig>22</NotesHeightBig>
<notesswfsmall>notes/notessmall7.swf</notesswfsmall>
<NotesHeightSmall>22</NotesHeightSmall>
<SlideTime>90</SlideTime>
<waitforuser>false</waitforuser>
<Hidden>false</Hidden>
<navlocked>false</navlocked>
<branch>
<prev>default</prev>
<next>default</next>
</branch>
<DisplayMode></DisplayMode>
<level>0</level>
<PlayListId>-1</PlayListId>
<annotations>
</annotations>
<SlideText><![CDATA[Truth Table for the Disjunction Make the table as for the conjunction. A disjunction is false only if both propositions are false. In-class Assignment 9 - 2 ]]></SlideText>
<framerate>30</framerate>
</Slide>
<Slide id="66631b67-0116-409a-be89-cb8fdfcccf5d">
<Filename>slide8.swf</Filename>
<BackgroundFile>bgd1l2.swf</BackgroundFile>
<Title><![CDATA[Conditional or Implication]]></Title>
<Notes><![CDATA[No in-class assignment problem]]></Notes>
<notesswfbig>notes/notesbig8.swf</notesswfbig>
<NotesHeightBig>22</NotesHeightBig>
<notesswfsmall>notes/notessmall8.swf</notesswfsmall>
<NotesHeightSmall>22</NotesHeightSmall>
<SlideTime>90</SlideTime>
<waitforuser>false</waitforuser>
<Hidden>false</Hidden>
<navlocked>false</navlocked>
<branch>
<prev>default</prev>
<next>default</next>
</branch>
<DisplayMode></DisplayMode>
<level>0</level>
<PlayListId>-1</PlayListId>
<annotations>
</annotations>
<SlideText><![CDATA[Conditional or Implication A conditional proposition is a compound proposition which consists of 2 propositions joined by the connective  If & then &  .  Denoted  p ’! q. p ’! q is read  If p then q  or  p implies q.  No in-class assignment problem ]]></SlideText>
<framerate>30</framerate>
</Slide>
<Slide id="daf68160-b23a-4fa7-b857-baaab4a79329">
<Filename>slide9.swf</Filename>
<BackgroundFile>bgd1l2.swf</BackgroundFile>
<Title><![CDATA[Truth Values of a Conditional Proposition   You Decide]]></Title>
<Notes><![CDATA[In-class Assignment 9 - 3]]></Notes>
<notesswfbig>notes/notesbig9.swf</notesswfbig>
<NotesHeightBig>22</NotesHeightBig>
<notesswfsmall>notes/notessmall9.swf</notesswfsmall>
<NotesHeightSmall>22</NotesHeightSmall>
<SlideTime>90</SlideTime>
<waitforuser>false</waitforuser>
<Hidden>false</Hidden>
<navlocked>false</navlocked>
<branch>
<prev>default</prev>
<next>default</next>
</branch>
<DisplayMode></DisplayMode>
<level>0</level>
<PlayListId>-1</PlayListId>
<annotations>
</annotations>
<SlideText><![CDATA[Truth Values of a Conditional Proposition   You Decide Suppose the first day a class I made you the promise that if you studied hard then I would give you an A. Decide when I kept my promise. You studied hard and you got an A. You studied hard but didn t get an A. You didn t study hard and got an A. You didn t study hard and you didn t get an A.  In-class Assignment 9 - 3 ]]></SlideText>
<framerate>30</framerate>
</Slide>
<Slide id="feebd95b-1664-47c7-a23e-b2a62d1b34a2">
<Filename>slide10.swf</Filename>
<BackgroundFile>bgd1l12.swf</BackgroundFile>
<Title><![CDATA[Truth Table for Conditionals]]></Title>
<Notes><![CDATA[In-class Assignment 9 - 3]]></Notes>
<notesswfbig>notes/notesbig10.swf</notesswfbig>
<NotesHeightBig>22</NotesHeightBig>
<notesswfsmall>notes/notessmall10.swf</notesswfsmall>
<NotesHeightSmall>22</NotesHeightSmall>
<SlideTime>90</SlideTime>
<waitforuser>false</waitforuser>
<Hidden>false</Hidden>
<navlocked>false</navlocked>
<branch>
<prev>default</prev>
<next>default</next>
</branch>
<DisplayMode></DisplayMode>
<level>0</level>
<PlayListId>-1</PlayListId>
<annotations>
</annotations>
<SlideText><![CDATA[Truth Table for Conditionals  Make the truth table in the same way as for the conjunction and disjunction. A conditional is false only when T’!F. In-class Assignment 9 - 3 ]]></SlideText>
<framerate>30</framerate>
</Slide>
<Slide id="1ca0049a-62b0-40ec-812e-22a8279e1025">
<Filename>slide11.swf</Filename>
<BackgroundFile>bgd1l2.swf</BackgroundFile>
<Title><![CDATA[Bi-conditional or Equivalence]]></Title>
<Notes><![CDATA[In-class Assignment 9 - 4]]></Notes>
<notesswfbig>notes/notesbig11.swf</notesswfbig>
<NotesHeightBig>22</NotesHeightBig>
<notesswfsmall>notes/notessmall11.swf</notesswfsmall>
<NotesHeightSmall>22</NotesHeightSmall>
<SlideTime>90</SlideTime>
<waitforuser>false</waitforuser>
<Hidden>false</Hidden>
<navlocked>false</navlocked>
<branch>
<prev>default</prev>
<next>default</next>
</branch>
<DisplayMode></DisplayMode>
<level>0</level>
<PlayListId>-1</PlayListId>
<annotations>
</annotations>
<SlideText><![CDATA[Bi-conditional or Equivalence A bi-conditional proposition is a compound proposition which consists of 2 propositions joined by the connective phrase  if and only if.   Denote:  p ”! q.  Meaning: (p ’! q)    (q ’! p)  It is read as  p if ’! and only if q.  The word equivalence implies the truth value is true if the propositions have the same truth value.  In-class Assignment 9 - 4 ]]></SlideText>
<framerate>30</framerate>
</Slide>
<Slide id="2f4159d6-21e2-4a5c-ad36-baa0d8ce13b2">
<Filename>slide12.swf</Filename>
<BackgroundFile>bgd1l12.swf</BackgroundFile>
<Title><![CDATA[Truth Tables for Bi-conditionals]]></Title>
<Notes><![CDATA[In-class Assignment 9   4, 5]]></Notes>
<notesswfbig>notes/notesbig12.swf</notesswfbig>
<NotesHeightBig>22</NotesHeightBig>
<notesswfsmall>notes/notessmall12.swf</notesswfsmall>
<NotesHeightSmall>22</NotesHeightSmall>
<SlideTime>90</SlideTime>
<waitforuser>false</waitforuser>
<Hidden>false</Hidden>
<navlocked>false</navlocked>
<branch>
<prev>default</prev>
<next>default</next>
</branch>
<DisplayMode></DisplayMode>
<level>0</level>
<PlayListId>-1</PlayListId>
<annotations>
</annotations>
<SlideText><![CDATA[Truth Tables for Bi-conditionals Make the table in the same way as for the others. A bi-conditional (equivalence) is true only if the truth values are the same. In-class Assignment 9   4, 5 ]]></SlideText>
<framerate>30</framerate>
</Slide>
<Slide id="b475ae3e-7669-4777-b2ad-039cb9353ce3">
<Filename>slide13.swf</Filename>
<BackgroundFile>bgd1l2.swf</BackgroundFile>
<Title><![CDATA[Rules of Logic]]></Title>
<Notes><![CDATA[No in-class assignment problem]]></Notes>
<notesswfbig>notes/notesbig13.swf</notesswfbig>
<NotesHeightBig>22</NotesHeightBig>
<notesswfsmall>notes/notessmall13.swf</notesswfsmall>
<NotesHeightSmall>22</NotesHeightSmall>
<SlideTime>90</SlideTime>
<waitforuser>false</waitforuser>
<Hidden>false</Hidden>
<navlocked>false</navlocked>
<branch>
<prev>default</prev>
<next>default</next>
</branch>
<DisplayMode></DisplayMode>
<level>0</level>
<PlayListId>-1</PlayListId>
<annotations>
</annotations>
<SlideText><![CDATA[Rules of Logic Negation   change the truth value. Conjunction   True only if both are true. Disjunction   False only if both are false or true if at least one is true. Conditional   False only if true points to false. Bi-conditional   True if the truth values are the same.  No in-class assignment problem ]]></SlideText>
<framerate>30</framerate>
</Slide>
<Slide id="ffec9c1a-8374-40e2-a416-c2efb8cfeaa9">
<Filename>slide14.swf</Filename>
<BackgroundFile>bgd1l13.swf</BackgroundFile>
<Title><![CDATA[Truth Table for Logic Rules]]></Title>
<Notes><![CDATA[In-class Assignment 9 - 5]]></Notes>
<notesswfbig>notes/notesbig14.swf</notesswfbig>
<NotesHeightBig>22</NotesHeightBig>
<notesswfsmall>notes/notessmall14.swf</notesswfsmall>
<NotesHeightSmall>22</NotesHeightSmall>
<SlideTime>90</SlideTime>
<waitforuser>false</waitforuser>
<Hidden>false</Hidden>
<navlocked>false</navlocked>
<branch>
<prev>default</prev>
<next>default</next>
</branch>
<DisplayMode></DisplayMode>
<level>0</level>
<PlayListId>-1</PlayListId>
<annotations>
</annotations>
<SlideText><![CDATA[Truth Table for Logic Rules In-class Assignment 9 - 5 ]]></SlideText>
<framerate>30</framerate>
</Slide>
</Slides>
</Presentation>