Strategies for
solving proofs
Strategy 1: Always begin by attempting to
"find" the conclusion in the premises.
Strategy 2: If the conclusion contains a letter that appears
in the consequent of a condi
1
EXERCISE 6.1
I. Translate the following statements into symbolic form using capital letters to represent
affirmative English statements:
1. California does not allow smoking in restaurants.
use conv
1
II. Write the following compound statements in symbolic form, then use your knowledge
of the historical events referred to by the simple statements to determine the truth value
of the compound state
Exercise 5.3 Part I
1. All M are P. All M are S. All S are P. Invalid Illicit minor
2. Some P are M All S are M. Some S are P. Invalid Undistributed middle
3. No Mare P. Some S are M. Some S are not P
EXERCISE 5.5
Translate the following arguments into standard-form categorical syllogisms, then use Venn diagrams
or the rules for syllogisms to determine whether each is valid or invalid. See Section
Exercise 5.2
Part I
1. All C are U.
Some U are I.
Some I are C.
AII-4
Invalid
2. No A are P.
Some K are A.
Some K are not P.
EIO-1
Valid, Boolean and
Aristotelian
3. No I are P.
All T are P.
Some T ar
Exercise 5.1
Part I
1. Major term: things that produce intense gravity.
Minor term: extremely dense objects.
Middle term: neutron stars.
Mood, gure: AAA-3; invalid
2. Major term: insects that should b
Study Guide for Categorical Logic
There are 4 Standard Form categorical propositions:
(A) All S are P
(E) No S are P (I) Some S are P (O) Some S are not P
each categorical proposition has 4 parts: a q
1.
Some non-T are M. (conv., obv.)
All non-I are non-M. (contrapose)
Some I are T.
Some M are not T.
All M are I.
Some I are T.
Invalid Drawing affirmative conclusion from a negative premise
2.
A11 S
Symbolic Logic Exam 2 study guide
+
Categorical syllogisms (argument):
A deductive argument
Has three categorical propositions
Three terms, each term is repeated twice:
a) Major term in the first p
Your submission was received by the Grade Grinder (gradegrinder.stanford.edu) at
Tue Nov 22 09:05:07 UTC 2011
and was assigned ID number
11.326.09.05.06.L21-0520276
Grade report will be sent to:
ad
Your submission was received by the Grade Grinder (gradegrinder.stanford.edu) at
Tue Nov 22 01:04:41 UTC 2011
and was assigned ID number
11.326.01.04.41.L21-0520276
Grade report will be sent to:
ad
Your submission was received by the Grade Grinder (gradegrinder.stanford.edu) at
Mon Oct 17 19:16:26 UTC 2011
and was assigned ID number
11.290.19.16.26.L21-0520276
Grade report will be sent to:
ad
LPL Software Manual
LPL Software Manual
Dave Barker-Plummer, Jon Barwise, John Etchemendy
Albert Liu, Michael Murray, Emma Pease
CSLI Publications
Copyright c 1999, 2000, 2005, 2007, 2008, 2009, 2011
Your submission was received by the Grade Grinder (gradegrinder2.stanford.edu) at
Tue Nov 22 07:08:03 UTC 2011
and was assigned ID number
11.326.07.08.02.L21-0520276
Grade report will be sent to:
a
Your submission was received by the Grade Grinder (gradegrinder2.stanford.edu) at
Mon Oct 17 16:00:05 UTC 2011
and was assigned ID number
11.290.16.00.05.L21-0520276
Grade report will be sent to:
a