b) The meaning of "child" would need to be taken in the sense of age, as most people would find the idea of a young child going to jail as wrong.

Similar documents
Also, in Argument #1 (Lecture 11, Slide 11), the inference from steps 2 and 3 to 4 is stated as:

Study Guides. Chapter 1 - Basic Training

Artificial Intelligence: Valid Arguments and Proof Systems. Prof. Deepak Khemani. Department of Computer Science and Engineering

PHI 1500: Major Issues in Philosophy

Semantic Entailment and Natural Deduction

Lecture 3 Arguments Jim Pryor What is an Argument? Jim Pryor Vocabulary Describing Arguments

C. Exam #1 comments on difficult spots; if you have questions about this, please let me know. D. Discussion of extra credit opportunities

Logic Appendix: More detailed instruction in deductive logic

HANDBOOK (New or substantially modified material appears in boxes.)

9 Methods of Deduction

Appendix: The Logic Behind the Inferential Test

Chapter 9- Sentential Proofs

PHILOSOPHY 102 INTRODUCTION TO LOGIC PRACTICE EXAM 1. W# Section (10 or 11) 4. T F The statements that compose a disjunction are called conjuncts.

Chapter 3: More Deductive Reasoning (Symbolic Logic)

MATH1061/MATH7861 Discrete Mathematics Semester 2, Lecture 5 Valid and Invalid Arguments. Learning Goals

MCQ IN TRADITIONAL LOGIC. 1. Logic is the science of A) Thought. B) Beauty. C) Mind. D) Goodness

PHIL2642 CRITICAL THINKING USYD NOTES PART 1: LECTURE NOTES

Norva Y S Lo Produced by Norva Y S Lo Edited by Andrew Brennan. Fallacies of Presumption, Ambiguity, and Part-Whole Relations

Philosophy 1100: Ethics

2. Refutations can be stronger or weaker.

Relevance. Premises are relevant to the conclusion when the truth of the premises provide some evidence that the conclusion is true

What is an argument? PHIL 110. Is this an argument? Is this an argument? What about this? And what about this?

Chapter 1. What is Philosophy? Thinking Philosophically About Life

HANDBOOK. IV. Argument Construction Determine the Ultimate Conclusion Construct the Chain of Reasoning Communicate the Argument 13

Logic: A Brief Introduction. Ronald L. Hall, Stetson University

Complications for Categorical Syllogisms. PHIL 121: Methods of Reasoning February 27, 2013 Instructor:Karin Howe Binghamton University

PHIL 115: Philosophical Anthropology. I. Propositional Forms (in Stoic Logic) Lecture #4: Stoic Logic

Revisiting the Socrates Example

LOGIC ANTHONY KAPOLKA FYF 101-9/3/2010

Chapter 8 - Sentential Truth Tables and Argument Forms

Validity & Soundness LECTURE 3! Critical Thinking. Summary: In this week s lectures, we will learn! (1) What it is for an argument to be valid.

Basic Concepts and Skills!

SHORT ANSWER. Write the word or phrase that best completes each statement or answers the question.

Instructor s Manual 1

Module 5. Knowledge Representation and Logic (Propositional Logic) Version 2 CSE IIT, Kharagpur

1. To arrive at the truth we have to reason correctly. 2. Logic is the study of correct reasoning. B. DEDUCTIVE AND INDUCTIVE ARGUMENTS

Logic & Proofs. Chapter 3 Content. Sentential Logic Semantics. Contents: Studying this chapter will enable you to:

4.1 A problem with semantic demonstrations of validity

A R G U M E N T S I N A C T I O N

Philosophy 1100: Introduction to Ethics. Critical Thinking Lecture 1. Background Material for the Exercise on Validity

Selections from Aristotle s Prior Analytics 41a21 41b5

Criticizing Arguments

INTERMEDIATE LOGIC Glossary of key terms

VERITAS EVANGELICAL SEMINARY

What are Truth-Tables and What Are They For?

Suppressed premises in real life. Philosophy and Logic Section 4.3 & Some Exercises

Artificial Intelligence Prof. P. Dasgupta Department of Computer Science & Engineering Indian Institute of Technology, Kharagpur

In view of the fact that IN CLASS LOGIC EXERCISES

Paradox of Deniability

5.6.1 Formal validity in categorical deductive arguments

Argumentation Module: Philosophy Lesson 7 What do we mean by argument? (Two meanings for the word.) A quarrel or a dispute, expressing a difference

Recall. Validity: If the premises are true the conclusion must be true. Soundness. Valid; and. Premises are true

1 Logical Form and Sentential Logic

Announcements. CS243: Discrete Structures. First Order Logic, Rules of Inference. Review of Last Lecture. Translating English into First-Order Logic

PHI 1500: Major Issues in Philosophy

How Gödelian Ontological Arguments Fail

Norva Y S Lo Produced by Norva Y S Lo Edited by Andrew Brennan

Philosophical Arguments

PHI 244. Environmental Ethics. Introduction. Argument Worksheet. Argument Worksheet. Welcome to PHI 244, Environmental Ethics. About Stephen.

Introduction to Logic

Introducing Our New Faculty

Overview of Today s Lecture

Scott Soames: Understanding Truth

Aquinas' Third Way Modalized

Natural Deduction for Sentence Logic

Example Arguments ID1050 Quantitative & Qualitative Reasoning

Generic truth and mixed conjunctions: some alternatives

An Introduction to. Formal Logic. Second edition. Peter Smith, February 27, 2019

Exposition of Symbolic Logic with Kalish-Montague derivations

Rosen, Discrete Mathematics and Its Applications, 6th edition Extra Examples

ARGUMENTS. Arguments. arguments

INTRODUCTION. This week: Moore's response, Nozick's response, Reliablism's response, Externalism v. Internalism.

An Inferentialist Conception of the A Priori. Ralph Wedgwood

Courses providing assessment data PHL 202. Semester/Year

MODUS PONENS AND MODUS TOLLENS: THEIR VALIDITY/INVALIDITY IN NATURAL LANGUAGE ARGUMENTS

T. Parent. I shall explain these steps in turn. Let s consider the following passage to illustrate the process:

There are two common forms of deductively valid conditional argument: modus ponens and modus tollens.

Exercise Sets. KS Philosophical Logic: Modality, Conditionals Vagueness. Dirk Kindermann University of Graz July 2014

Introduction to Logic

Logic Book Part 1! by Skylar Ruloff!

The antecendent always a expresses a sufficient condition for the consequent

Artificial Intelligence Prof. P. Dasgupta Department of Computer Science & Engineering Indian Institute of Technology, Kharagpur

Tutorial A03: Patterns of Valid Arguments By: Jonathan Chan

Part II: How to Evaluate Deductive Arguments

GENERAL NOTES ON THIS CLASS

Handout 1: Arguments -- the basics because, since, given that, for because Given that Since for Because

Introduction Symbolic Logic

HOW TO ANALYZE AN ARGUMENT

HANDBOOK (New or substantially modified material appears in boxes.)

The Little Logic Book Hardy, Ratzsch, Konyndyk De Young and Mellema The Calvin College Press, 2013

Introduction to Philosophy

Situations in Which Disjunctive Syllogism Can Lead from True Premises to a False Conclusion

HAVE WE REASON TO DO AS RATIONALITY REQUIRES? A COMMENT ON RAZ

Day 3. Wednesday May 23, Learn the basic building blocks of proofs (specifically, direct proofs)

Critical Thinking 5.7 Validity in inductive, conductive, and abductive arguments

Conditionals IV: Is Modus Ponens Valid?

Lecture 17:Inference Michael Fourman

Practice Test Three Spring True or False True = A, False = B

The way we convince people is generally to refer to sufficiently many things that they already know are correct.

A. Problem set #3 it has been posted and is due Tuesday, 15 November

Transcription:

Explanation for Question 1 in Quiz 8 by Norva Lo - Tuesday, 18 September 2012, 9:39 AM The following is the solution for Question 1 in Quiz 8: (a) Which term in the argument is being equivocated. (b) What meaning does the term need to have to make the first premise true (or plausible)? (c) What meaning does the term need to have to make the second premise true? (d) If the term in question is given the same meaning throughout the argument, then will all the premises be true (or plausible)? Explain your answer. (e) If the term in question is given different meanings in different places where it occurs in the argument, then will the argument be valid? Explain your answer. (f) Is the argument sound? Explain you answer. Re: Explanation for Question 1 in Quiz 8 by Christie - Wednesday, 3 October 2012, 5:33 PM a) The term "child" as it is used in different places to mean different things. b) The meaning of "child" would need to be taken in the sense of age, as most people would find the idea of a young child going to jail as wrong. c) Here "child" needs to mean anyone who has parents (so, of course everyone) rather than the sense of being a child due to age. d) Regardless of which meaning is used all the premises will not be true / plausible. This is because ["child" means either "a very young person - a kid" or "anyone who has parents". If the term means "kid" consistently throughout the argument, then the second premise would be false - as not everyone is a kid. But if the term means "anyone who has parents", then P1 would be false - as] it would be ridiculous to never send anyone to jail regardless of their crimes on the basis that they are someones child. e) The argument would be invalid as it uses different meanings throughout the argument in an attempt to make all premises true. [For the argument has the logical form "No one who is A is B. Everyone is A. Therefore, no one is B. This argument is valid only if "A" means the same thing throughout the argument. So, if "A" (in this case - "child") means different things in the two different premises, then the argument is invalid.] f) The argument is not sound as in order to be sound an argument first needs to be valid and have true premises. [Now, either the term "child" means the same thing throughout the argument or it does not. If the term means the same thing throughout, then not all premises are true - for reasons given in (d). But if it does not mean the same thing throughtout, then] This argument is invalid [for the reasons given in (e). So, the argument is unsound either way. The argument, being unsound in the above ways, commits] due to committing the fallacy of Equivocation. (Edited by Norva Lo - original submission Wednesday, 3 October 2012, 01:16 PM) Re: Explanation for Question 1 in Quiz 8 by Norva Lo - Wednesday, 201, 5:07 PM Your answers are quite good indeed. I have edited them to make some improvements.

Re: Explanation for Question 1 in Quiz 8 by Hannah - Sunday, 7 October 2012, 8:54 PM (a) The term child is being equivocated, because it is being used misleadingly with more than one meaning. (b) The meaning of the initial use of child, in order to make the first premise true, would need to relate to and define the chronological age of a child. (c) For the second premise to be true child needs to form the argument that every person has a set of parents; therefore everyone is a child of someone, regardless of chronological age. (d) No, if child was given the same meaning throughout, all premises would not be true or plausible. Because in premise one, child needs to refer to chronological age in order to be true, but if this definition carried over into premise two, not everyone is the chronological age of a child by definition. Thus causing the premise to be false. (e) The argument would be invalid, because the argument requires child to mean the same thing throughout in order to be logically valid. oing so. (f) The argument is unsound as it commits the fallacy of equivocation.

Explanation for Question 4 in Quiz 7 by Norva Lo - Sunday, 30 September 2012, 9:24 PM The following is the solution for Question 4 in Quiz 7: (a) Use "p" to represent the sentence "less than 50% of women below the age of 40 are mothers". Use "q" to represent the sentence "less then 50% of women below the age of 30 are mothers". Rewrite the whole argument above in terms of "p" and "p" - i.e., use "p" and "q" to replace the sentences they represent. (b) What is the name of the argument form that the whole argument has? (c) Explain why option 1 is an incorrect answer (i.e., why the argument does not have the form of Inductive Generalzation). (d) Explain why option 10 is a correct answer (i.e., why the argument is successful). Re: Explanation for Question 4 in Quiz 7 by Hannah - Sunday, 7 October 2012, 2:44 PM Export to portfolio (a) P q p -------- q (b) The Argument is in the form of Modus Ponens (MP) (c) (d Re: Explanation for Question 4 in Quiz 7 by Norva Lo - nday, 201, 8:58 PM Export to portfolio Your answers to parts (a) and (b) are correct. For part (c), your answer is incorrect. If an argument fits the form of inductive generalization then it is an inductive generalization - even if the sub-group involved is not representative. But in the case of the argument under consideration, it does not fit the form of inductive generalization at all. That's the real reason why it is not an inductive generalization. For part (d), you have not actually given an explanation or why the argument under consideration is successful. You answer in effect just states the definition for nondeductive success and says the argument meets the definition. the correct explanation should be as follows: Since the argument fits the valid argument form Modus Ponens (as shown in parts (a) and (b)), the argument is a valid one. But all valid arguments are nondeductively successful. Therefore the argument in question is a successful one. Export to portfolio

Explanation for Question 5 in Quiz 8 by Norva Lo - Sunday, 30 September 2012, 9:26 PM The following is the solution for Question 5 in Quiz 8: (a) Explain why option 1 is correct (i.e., in what way the argument commits the fallacy of Begging the Question). (b) What is the name of the argument form that the whole argument above has? (c) Is the argument valid? Explain why. (d) Is the argument successful? Explain why. (e) Is the argument a good one? Explain why. Re: Explanation for Question 5 in Quiz 8 by Anna - nday, 1 201, 8:19 PM Reply Export to portfolio a) The argument commits this fallacy because the second premise ("some swans are red") is the same as the conclusion ("some swans are red"). No independent evidence has been given to support the premise, which begs the question "but how do you know that some swans are red?" - which is what the conclusion claims. b) The argument is in the form of Modus Ponens (MP). A B ("If some swans are red, then some swans are red") A ("Some swans are red") ------------------------------------------------------------------- B ("Some swans are red") How can this be Modus Ponenes when A and B are actually the same atomic argument? Surely it is - as A = B in this case, but it is still MP because the form of MP allows that A and B to stand for the same proposition. The follow argument fits the form of MP. p p p -------- p c) The argument is valid. The truth of the premises guarantees 100% the truth of the conclusion. If some swans are red, then, logically, undisputedly, some swans must be red. It is logically impossible for the premises to be true and the conclusion false at the same time. These factors give validity to the argument. Indeed since the argument fits the form MP, and MP is a valid argument form, the argument is a valid one. d) This argument is successful. The truth of the premises, that some swans are red (when it is assumed to be true), makes the conclusion, that some swans are red, more likely to be true than false - i.e., the conclusion has more than a 50% chance to be true under the assumption of the premises. Indeed, since the argument is valid, as shown in part (c), we can already infer that the argument is successful, as all valid arguments are successful - by the definitions of validity and (nondeductive) success e) The argument is not a good one. It commits the fallacy of begging the question, as mentioned, in that its premises do not provide any independent support for the conclusion. Re: Explanation for Question 5 in Quiz 8 by Norva Lo - day, 2 201, :1 PM Export to portfolio Excellent Export to portfolio

Quiz 11 by Matthew - Monday, 15 October 2012, 11:46 PM I got question 6 wrong in every attempt. This form makes no sense to me Once the answers have been could you explain this form to me please Re: Quiz 11 by Norva Lo - Tuesday, 16 October 2012, 05:23 PM Hi Matthew, Question 6 in Quiz 11 is as follows The given argument actually does not fit any of the argument forms listed in the first 10 options. So the correct answer is the final option "None of the above". Explanation: Firstly, in order to decide what argument form/structure the argument has, we need to check whether any clause within the argument is repeated. I have highlighted in different colours the different clauses that are repeated in the argument. p v ~p p (q v r) ~p (s v r) ----------- --- Secondly, we can extract a more general structure of the argument by replacing all the repeated clauses by BIG letters in the following way: A v B A C B D ----------- C & D where: A = p, B = ~p, C = q v r, D = s v r. This more general structure (put in terms of BIG letters) is the argument form of the original given argument. As we can see, it does not fit any of the argument forms listed in the options in the question. That's why the last option "None of the above" is the correct answer. NOTE: The conclusion of the argument has the form "C & D". This makes the argument form different from the argument form Constructive Dilemma, where the conclusion is "C v D". Were the "&" in the original argument replaced by a "v" instead, then the resulting argument would fit the form of Constructive Dilemma. But as it stands, the original argument does not fit that form. Cheers, Norva

A is not a sufficient condition for B by Norva Lo - Monday, 8 October 2012, 5: PM "A is not a sufficient condition for B." How should the above statement be symbolized as a logical formula? Re: A is not a sufficient condition for B by Katrina -, 201, 10:15 M Reply Export to portfolio ~(A B) Re: A is not a sufficient condition for B by Norva Lo - day, 1 201, 10:16 PM Very good Export to portfolio A is not a necessary condition for B by Norva Lo - Monday, 8 October 2012, 5:10 PM "A is not a necessary condition for B." How should the above statement be symbolized as a logical formula? Re: A is not a necessary condition for B by Natalie - day, 201, :16 PM Reply Export to portfolio ~ (~ A ~ B) Re: A is not a necessary condition for B by Norva Lo -, 201, :17 PM Well done Export to portfolio A is not both a necessary and a sufficient condition for B by Norva Lo - nday, 201, :28 PM "A is not both a necessary and a sufficient condition for B." How should the above statement be symbolized as a logical formula? Re: A is not a necessary and sufficient condition for B by Katrina - day, 2 201, 10:29 PM Reply Export to portfolio Would ~(A B) be a correct answer? Or would I have to write it out like: ~(~A " ~B) & ~(A " B) Re: A is not a necessary and sufficient condition for B by Norva Lo - day, 1 201, 1 :34 M Quite good ~(A B) is correct, but does not display the logical structure of the original statement in its full details. Your more complex answer (which does display more logical structure), however, is in part incorrect. The correct full formulation for "A is not both a necessary and a sufficient condition for B" should be: ~((~A " ~B) & (A " B)), which literally means "it is not the case that A is a necessary condition for B and A is a sufficient condition for B". It is also equivalent to: ~((B " A) & (A " B)) Important: The difference between ~X & ~Y on the one hand, and ~(X & Y) on the other hand, is that the latter means "not both X and Y" which allows the possibility of "X or Y". But the former does not allow that possibility. Cheers, Norva Export to portfolio

"#"$$%&'()*+%($"*,&"-'$"$* *./0$'1"&*23"*4/((/5'06*%&67-"028** "#$%&'()%'(*)%(+,'('()-'.# /#0123422(%&)..&)(,12(25,62*24'.2.27,)+(#864+-"9 9"#%((*23"*1"4'0'2'/0*/4*:;%('1'2)<: $('4;<-2(,64+-",+/)%='.)* >?,)%)-@+%%)A.2,1',")%,4<2A<,/)%6'.%2',,12%'-2,)-2# >?,)%)-@+%%)A.2,1',")%,4<2'(*~/)%,4<2',,12%'-2,)-2# >?,)%)-@+%%)A.2,1',"'(*~/'42A+,1,4<2',,12%'-2,)-2# >?,)%)-@+%%)A.26+4,127+(B<(7,)+(C"D~/C,+A2,4<2# E+C,12*26)(),)+(+6F='.)*),GH)-@.)2%:?6),)%)-@+%%)A.26+4,127+(B<(7,)+(C"D~/C,+A2,4<2C,12(,12'4;<-2(,64+- ",+/)%='.)*# * * =0$5"&*23"*4/((/5'06*>7"$2'/0$*%?/72*23"*%&67-"028* 8'9?%),@+%%)A.26+4",+A2,4<2IJ5@.')(G+<4'(%&24# 8A9?%),@+%%)A.26+4,127+(B<(7,)+(C"D~/C,+A2,4<2IJ5@.')(G+<4'(%&24# 879?%,12'4;<-2(,64+-",+/='.)*IK;)=2(&1',,12*26)(),)+(+6L='.)*),GL)-@.)2%#J5@.')(G+<4'(%&24# 8*9?%,12'4;<-2(,64+-",+/%+<(*IJ5@.')(G+<4'(%&24# @AB:$(%&24%,+8A9'(*8797'(A26+<(*+(@@#MNKMOC/1'@,24MC"#$#%&'()*(+#,')%-%./8P0QP)A4'4G2K42%24=29 * CDEFG*=HIF9H 8'9?,)%?R"SEE?TPJ6+4",+A2,4<2A27'<%2),)%'%2.6K7+(,4'*)7,)+(# 8A9?, )%?R"SEE?TPJ 6+4,12 7+(B<(7,)+( "D~/,+ A2,4<2C %)-@.G A27'<%2 ), )% )-@+%%)A.2 6+4 ",+ A2,4<2# U+4 ' 7+(B<(7,)+(,+A2@+%%)A.G,4<2CA+,17+(B<(7,%(22*,+A2@+%%)A.G,4<2#E+C)6+(2+6,127+(B<(7,%)%)-@+%%)A.2 8)#2#C(272%%'4).G6'.%29C,12(,12&1+.27+(B<(7,)+()%)-@+%%)A.28)#2#C(272%%'4).G6'.%29# 879 012'4;<-2(,)%V$P?W#012*26)(),)+(+6L='.)*),GL)-@.)2%,1','('4;<-2(,64+-",+/)%='.)*)6'(*+(.G)6),)% (+, @+%%)A.2 6+4,12 &1+.2 7+(B<(7,)+( "D~/,+ A2,4<2# 012 '4;<-2(, )( X<2%,)+( )% )(*22* +(2 &1242 ), )% )-@+%%)A.2 6+4 "D~/,+ A2,4<2 K A27'<%2 " )% (272%%'4).G 6'.%2C '% 25@.')(2* )( @'4, 8A9# E+C,12 '4;<-2(, )% 8,271()7'..G9='.)*# 8*9 012'4;<-2(,)%QYESQYW#$('4;<-2(,)%%+<(*)6'(*+(.G)6),)%='.)*'(*'..),Z%@42-)%2%'42,4<2#T<,@42-)%2 ")(,12'4;<-2(,)%6'.%2KA27'<%2),)%%2.6K7+(,4'*)7,+4G'(*(272%%'4).G6'.%2#

"#"$$%&'()*+&,"*-./#(,$'./* * -./$'0"&*12"*3.((.4'/5*%&5,6"/17** "#$%&'()*+,-.,//,*.0/,-1-,230/*,./)1.4&5,/60/-71.4&8)*,+)# 9#:.*%&+,--;&/,+&;0+*,-0+/0*,--;&/,+&;0+*,-#51+0;"8 8"#%((*12"*0"3'/'1'./*.3*9:%('0'1); '/,+2(;&/*1+0;"*09.)4,-.6 <=*.).;>0)).?-&*%,*".)*+(&?(*9.)1,-)&,**%&),;&*.;&# <=*.).;>0)).?-&*%,*".)*+(&,/6~9.)*+(&,**%&),;&*.;&# <=*.).;>0)).?-&*%,*",/6~9,+&?0*%*+(&,**%&),;&*.;&# <=*.).;>0)).?-&10+*%&30/@(/3*.0/A"B~9A*0?&*+(&# C0A*%&6&1./.*.0/01D4,-.6.*7D.;>-.&)E.1.*.).;>0)).?-&10+*%&30/@(/3*.0/A"B~9A*0?&*+(&A*%&/*%&,+2(;&/*1+0; "*09.)4,-.6# </$4"&*12"*3.((.4'/5*$"1*.3*=,"$1'./$*%>.,1*12"*%&5,6"/1E 5,8=).*>0)).?-&10+9*0?&1,-)&F:G>-,./70(+,/)H&+# 5?8=).*>0)).?-&10+~9*0?&*+(&F:G>-,./70(+,/)H&+# 538=).*>0)).?-&10+*%&30/@(/3*.0/A"B~9A*0?&*+(&F:G>-,./70(+,/)H&+# 568=)*%&,+2(;&/*1+0;"*094,-.6FI2.4&/H%,**%&6&1./.*.0/01D4,-.6.*7D.;>-.&)#:G>-,./70(+,/)H&+# 5&8=)*%&,+2(;&/*1+0;"*09)0(/6F:G>-,./70(+,/)H&+#?@+E '/)H&+)*0538,/65683,/?&6&+.4&61+0;*%&;06&-,/)H&+)*0*%&>+&4.0()J(&)*.0/0/K/&3&)),+.-71,-)& >+&;.)&)L# ABCDE*<FGD8C 5,8=*.)=M"NCC=OP:10+9*0?&1,-)&#Q0+9%,)*%&10+;K>0+/0*I>LH%.3%304&+),---02.3,->0)).?.-.*.&),/6*%&+&10+&.),/&3&)),+7*+(*%# 5?8=*.)=M"NCC=OP:10+~9*0?&*+(&#Q0+9.),/&3&)),+7*+(*%#$%&+&10+&A~9.),/&3&)),+71,-)&%006#=*.).;>0)).?-& 10+,/&3&)),+71,-)&%006*0?&*+(&# 538=*.)=M"NCC=OP:10+*%&30/@(/3*.0/"B~9*0?&*+(&A?&3,()&.*.).;>0)).?-&10+~9*0?&*+(&#Q0+,30/@(/3*.0/*0?&>0)).?-7*+(&A?0*%30/@(/3*)/&&6*0?&>0)).?-7*+(&#=10/&01*%&30/@(/3*).).;>0)).?-&A*%&H%0-&30/@(/3*.0/.).;>0)).?-&# 568$%&,+2(;&/*.)R'P=S#$%&6&1./.*.0/01D4,-.6.*7D.;>-.&)*%,*,/,+2(;&/*1+0;"*09.)4,-.6.1,/60/-7.1.*.).;>0)).?-&10+*%&H%0-&30/@(/3*.0/"B~9*0?&*+(&#$%&,+2(;&/*./J(&)*.0/.)0/&H%&+&.*.).;>0)).?-&10+"B~9 *0?&*+(&I&G>-,./&6./>,+*538#C0A*%&,+2(;&/*.)5*&3%/.3,--784,-.6# 5&8$%&,+2(;&/*.)TUCNTUS?&3,()&>+&;.)&"./*%&,+2(;&/*.)1,-)&#$%&'()*+,-.,//,*.0/,-1-,2,3*(,--730/*,./) ).GA/0*@()*1.4&A)*,+)5)&&/,*.0/,-1-,2%.)*0+78# *

"#$%$&'()*)+,"*% "#$%&'(')'*(+,(,-./0%()&-*01)*2'34,5'$'&,($*(5#'&')'3'06*33'75%&*-1)*7%)-/%7/)2)*7%&,53%,))8%3,0% )'0%9:(*)8%-;*-$3+4,5'$')#"#$%"&)8,))8%)-/)8*&17%'(<*06,)'75%;')8)8%&,53')#*&2+*-%=/'4,5%()5#+)8,)17% '(<*06,)'75% ;')8 ~2+ *- )8,) )8% <*(>/(<)'*( 1?~2 7% 5*.'<,55# '06*33'75%9 :( )8% 6-%3%() <,3%+ ~2 '3, 3%5&@ <*()-,$'<)'*(+,($)8%-%&*-%'3'(<*06,)'75%;')8%4%-#)8'(.+'(<5/$'(.19A'(<%~2'3'(<*06,)'75%;')8%4%-#)8'(.+') $*%3(*)-%,55#0,))%-;8,))8%<*()%()*&1'3+~2;'553)'557%'(<*06,)'75%;')819B8,)'3;8#)8%,-./0%()'34,5'$@ '($%6%($%()5#*&)8%<*()%()*&19:(38*-)+'&,(,-./0%()C3<*(<5/3'*('3(%<%33,-'5#)-/%+)8%(')'34,5'$(*0,))%- ;8,) ')3 6-%0'3%3 3,#9 D*-, (%<%33,-# )-/)8 '3 )-/% /($%-,55 5*.'<,55# 6*33'75% 3')/,)'*(39 A* (* 0,))%- ;8,) )8% 6-%0'3%33,#)8%3')/,)'*(3,-%+)8%(%<%33,-'5#)-/%<*(<5/3'*(-%0,'(3)-/%9 E()8%*)8%-3'$%*&)8%3,0%<*'(+'&,(,-./0%()<*(),'(3(%<%33,-'5#&,53%6-%0'3%3F*-'(<*(3'3)%()6-%0'3%3+)8% <*(>/(<)'*( *& ;8'<8 '3 (%<%33,-'5# &,53%G+ )8%( )8%,-./0%() '3 4,5'$ (* 0,))%- ;8,) )8% <*(<5/3'*( 3,#39 H8'5%, (%<%33,-#)-/)84,5'$5#&*55*;3&-*0

Discussion Question 10 by Julia - Wednesday, 3 October 2012, 3:41 PM Hi Norva, There was a discussion question at the end of Lecture 10 I'd like to work through. Question: Consider the following statements concerning a particular hand of cards. (1) There is a King in the hand, or an Ace, or both (2) There is a Queen in the hand, or an Ace, or both (3) There is a Jack in the hand, or an Ten, or both Suppose one and only one of the above statements is true. Under this supposition, could there be an Ace in the hand? Explain your answer. My answer: No. If you assume that there could be an Ace in the hand, that would mean that both (1) and (2) can be true. If only one of the statements is true, that would make it illogical that they were both true. Therefore they can't be true. So, it follows that if only one statement is true, the true one can only be statement (3). That means there could not be an Ace in the hand. Is this correct? Thanks, Julia Re: Discussion Question 10 by Norva Lo - Wednesday, 3 October 2012, 5:06 PM Very very good Indeed perfect. 2 bonus points for you. Reply Export to portfolio Without even looking at the question by Norva Lo - Monday, 22 October 2012, 7:02 PM You are sitting a multiple-choice exam. You get to a question about a murder investigation. The question gives you the following five options to choose from, and it tells you that just one of them is correct. Without even looking at the question, you should be able to work out which is the correct answer Which is it? Hint: Use RAA, and remember that the disjunction "or" is used in its inclusive sense. Choose one answer: A or B is guilty. A and D is guilty. A is guilty. B is guilty. C is guilty. Please provide an explanation for your answer Re: Without even looking at the question by Anna - Monday, 22 October 2012, 3:12 PM Is the answer that A or B is guilty, which means that A or B or both are guilty? But I am not sure how RAA comes into this (?). I am missing the twist with this question, can you re-explain it?

Re: Without even looking at the question by Norva Lo - Monday, 22 October 2012, 8:13 PM The "or" used in the question (as well as in this subject) is the inclusive "or" - i.e., "A or B" means "A or B or both". An extra hint is that "A" implies "A or B". For "A or B" simply means that at least one of the two disjuncts is true. So if we suppose that the 1st disjunct is true (i.e., "A" is true), then it follows that at least one of the two disjuncts is true (i.e., "A or B" is true). This question is very similar to one of the exam questions. So I cannot give you any more hints. However, there is another similar question (called "Discussion Question 10" ). Its solution by a fellow student is also posted there. Have a look at them, and see if you can work out the answer for this question here and provide an explanation for it. Re: Without even looking at the question by Anna - Tuesday, 23 October 2012, 3:14 PM So... if you assume that A is the murderer, then 1, 2 and 3 could be the correct answer. Since this is a multiple choice question, there is only one correct answer, therefore neither 1, 2 or 3 can be correct, and A cannot be the murderer. This leaves options 4 and 5. Option 4, B is guilty, is ruled out. This is because it was previously established that B is associated with A (A, B or both). Therefore if the murderer is not A, it follows that it cannot be B. The logical conclusion to the matter is to accept the final alternative, option 5, which states that C is the murderer. This option is the only statement that can be true given that the others are false. Is that right? Re: Without even looking at the question by Norva Lo - Tuesday, 23 October 2012, 3:29 PM Your reasoning is quite good But one step is still missing. "A & D" does not logically follow from "A". Can you explain why you think is "A & D" is not the correct answer? Re: Without even looking at the question by Anna - Thursday, 25 October 2012, 12:07 PM If A is assumed to be incorrect, then associating it with D does not make it more correct.a cannot be the murderer at all,therefore D cannot be the murderer. For this option to be true, both A and D must have murdered someone. Since A has not, D cannot have. The two are linked in a way that means they must both occur, or neither of them can occur. Re: Without even looking at the question by Peter Evans - Thursday, 25 October 2012, 6:15 PM You're almost there. Think of it in this way: you've already correctly pointed out that if you assume "A is guilty" is true, then it follows that "A or B is guilty" is true, and we can only have one correct answer so neither of these can be that answer. However, it doesn't follow from this assumption that "A and D is guilty" is true. But what follows when we assume that "A and D is guilty" is true?

Re: Without even looking at the question by Norva Lo - Sunday, 28 October 2012, 11:14 PM Extra hint: In order to test whether "A & D" is the correct answer, you need to assume "A & D" and check if it will lead to some consequence that contradicts with the info given by the question. If "A & D" leads to contradiction with the info given by the question, then "A & D" is not the correct answer; but if "A & D" does not lead to any contradiction with the info given by the question, then "A & D" might still be the correct answer - i.e., "A & D" is not ruled out. Re: Without even looking at the question by Anna - Wednesday, 31 October 2012, 10:47 AM If A&D are assumed to be guilty, then both must be guilty. This provides an issue with the option "A is guilty". For A is indeed guilty, A is a murderer (if A&D is assumed to be correct). While this is only a half truth, 'A is guilty' could still also be chosen. Because the two options can both be chosen at the same time, under the assumption that A&D is guilty, then that assumption is incorrect, and A&D cannot be guilty. Re: Without even looking at the question by Peter Evans - Wednesday, 31 October 2012, 10:55 AM Great -

Modus Tollens (MT) by Norva Lo - Monday, 1 October 2012, 5:19 PM The argument form of Modus Tollens (MT) is as follows: A B ~B --------- ~A Note: A and B are both place holders: Each place holder can stand for either an atomic formula or a compound formula. Exactly the same formula occupies all the positions marked by a particular place holder. Example #1: When A = p, B = q, we have the following argument in the form of Modus Tollens: p q ~q ------- ~p Example #2: When A = p & q, B = r v s, we have the following argument in the form of Modus Tollens: (p & q) (r v s) ~(r v s) ------------------- ~(p & q) Example #3: When A = ~p, B = ~q, we have the following argument in the form of Modus Tollens: ~p ~q ~~q ----------- ~~p (a) Suppose A = p q, B = r s. What argument in the form of Modue Tollens will we have? (b) Suppose A = ~(p q), B = ~(r s). What argument in the form of Modue Tollens will we have? (c) Suppose A = ~p q, B = ~r s. What argument in the form of Modue Tollens will we have? (d) Give an example of your own for an argument in the form of Modue Ponens. Also separately state what formula occupies the A-positions, and what formula occupies the B-positions, in the argument. Re: Modus Tollens (MT) by Katrina - Tuesday, 9 October 2012, 12:17 AM Reply Export to portfolio (p --> q) --> (r --> s) ~(r --> s) ----- -- ~(p --> q) ~(p --> q) --> ~(r --> s) ~{~(r --> s)} --------- - ~{~(p --> q)} (~p --> q) --> (~r --> s) ~(~r --> s) --------- - ~(~p --> q) ( & ) --> ~ ------ ---- ~( & Re: Modus Tollens (MT) by Norva Lo -, 0 201, 7:18 PM Very good indeed Note: To express the negation of ~A, we can simply write ~~A. There is no need to use brackets here - like ~(~A). So, your answer to part (b) can be simplified a bit by deleting the outmost set of brackets in the 2nd premise and the conclusion: the negation of ~(p q) can be simply written as: ~~(p q). Export to portfolio

Simplification (Simp.) by Norva Lo - Tuesday, 2 October 2012, 5:37 PM The argument form of Simplification (Simp.) is as follows: A & B A & B -------- or --------- A B Note: A and B are both place holders: Each place holder can stand for either an atomic formula or a compound formula. Exactly the same formula occupies all the positions marked by a particular place holder. Example #1: When A = p, B = q, we have the following arguments in the form of Simplification: p & q p & q ------- or ------- p q Example #2: When A = p & q, B = ~r ~s, we have the following argument in the form of Simplification: (p & q) & (~r ~s) ~r ~s) ------------------------ or ------------------------ p & q ~r ~s Example #3: When A = ~p v q, B = ~(p v q), we have the following argument in the form of Simplification: (~p v q) & ~(p v q) (~p v q) & ~(p v q) ----------------------- or ----------------------- ~p v q ~(p v q) (a) Suppose A = ~p, B = ~p. What argument in the form of Simplification will we have? (b) Suppose A = (p r) p, B = ~q r. What argument in the form of Simplification will we have? (c) Suppose A = ~p & (q v r), B = ~(p v q). What argument in the form of Simplification will we have? (d) Give your own example of an argument in the form of Simplification. Also separately state what formula occupies the A- positions, and what formula occupies the B-positions, in the argument. Re: Simplification (Simp.) by Hannah - Tuesday, 2 October 2012, 8:46 PM Reply Export to portfolio (a) ~p & ~q ~p & ~q ----------- or ----------- ~p ~q (b) ((p r) p) & (~q r) ((p r) p) & (~q r) ------------------------------- or -------------------------------- (p r) p ~q r (c) (~p & (q v r)) & ~(p v q) (~p & (q v r)) & ~(p v q) ----------------------------- or ------------------------------ ~p & (q v r) ~(p v q) (d) t & ~w t & ~w -------- or --------- t ~w A = t B = ~w Re: Simplification (Simp.) by Norva Lo -, :40 PM Correct Reply Export to portfolio

Constructive Dilemma (CD) by Norva Lo - Monday, 1 October 2012, 5:19 PM The argument form of Constructive Dilemma (CD) is as follows: A v B A C B D --------- C v D Note: A, B, C and D are all place holders: Each place holder can stand for either an atomic formula or a compound formula. Exactly the same formula occupies all the positions marked by a particular place holder. Example #1: When A = p, B = q, C = r, D = s, we have the following argument in the form of Constructive Dilemma: p v q p r q s -------- r v s Example #2: When A = p, B = ~p, C = q, D = q, we have the following argument in the form of Constructive Dilemma: p v ~p p q ~p q ----------------- q v q Example #3: When A = p & q, B = p & ~q, C = ~(r & s), D = ~r & s, we have the following argument in the form of Constructive Dilemma: (p & q) v (p & ~q) (p & q) ~(r & s) (p & ~q) (~r & s) ------------------------ ~(r & s) v (~r & s) (a) Suppose A = p, B = p, C = ~q, D = ~r. What argument in the form of Constructive Dilemma will we have? (b) Suppose A = p v q, B = r v s, C = ~r, D = ~p. What argument in the form of Constructive Dilemma will we have? (c) Suppose A = ~p, B = ~q, C = ~r s, D = ~(r s). What argument in the form of Constructive Dilemma will we have? (d) Give an example of your own for an argument in the form of Constructive Dilemma. Also separately state what formula occupies the A-positions, what formula occupies the B-positions, and what formula occupies the C-positions, in the argument.

Re: Constructive Dilemma (CD) by Jack - Friday, 5 October 2012, 12:59 AM Here is my answer to the avbove questions a) p v p p ~q p ~r ------------ ~q v ~r b) (p v q) v (r v s) (p v q) ~r (r v s) ~p --------------------- ~r v ~p c) ~p v ~q ~p (~r s) ~q ~(r s) ---------------------- ( ~r s) v ~(r s) d) my example A = X B = Z C = ~(M & N) D = L v R Although you didn't ask for it i thought it wouldn't hurt to add the formula which occupies the D-position in the argument X v Z X ~(M & N) Z (L v R) ---------------- ~(M & N) v (L v R) Re: Constructive Dilemma (CD) by Norva Lo - day, 201, :32 PM Perfect