Reasoning About Necessity and Possibility: A Test of The Mental Model Theory of Deduction
Reasoning About Necessity and Possibility: A Test of The Mental Model Theory of Deduction
Reasoning About Necessity and Possibility: A Test of The Mental Model Theory of Deduction
Philip N. Johnson-Laird
Princeton University
University of Plymouth
This article examined syllogistic reasoning that differs from previous research in 2 significant
ways: (a) Participants were asked to decide whether conclusions were possible as well as
necessary, and (b) every possible combination of syllogistic premises and conclusions was
presented for evaluation with both single-premise (Experiment 1) and double-premise
(Experiment 2) problems. Participants more frequently endorsed conclusions as possible than
as necessary, and differences in response to the 2 forms of instruction conformed to several
predictions derived from the mental model theory of deduction. Findings of Experiments 2 and
3 showed that some fallacies are consistently endorsed and others consistently resisted when
people are asked to judge whether conclusions that are only possible follow necessarily. This
finding was accounted for by the computational implementation of the model theory: Fallacies
are made when the first mental model of the premises considered supports the conclusion
presented.
1495
1496
finding which has led to much debate about human rationality (see Evans & Over, 1996; Manktelow & Over, 1993).
However, most psychologists in the area would agree that
untrained reasoners do show some basic deductive competence: For example, they can distinguish valid inferences
from fallacies at well above chance rates. Accounting for
such competence has, however, led to a protracted, sometimes heated, and as-yet unresolved debate between two
theoretical camps. The debate is focused on whether deductive reasoning is achieved by the use of mental rules or
mental models (see Evans et al., 1993, chapter 3, for detailed
coverage of the debate).
Rule-based theories derive from so-called natural deduction, a method of formalizing logic that is intuitively
plausible and that postulates rules of inference for each
logical term. The most durable of these have proved to be the
systems devised by Rips (1983, 1994) known as PSYCOP,
and the system developed by Braine and O'Brien (Braine,
1978; Braine & O'Brien, 1991; Braine, Reiser, & Rumain,
1984). However, we provide little discussion of these
theories in the present article for two reasons. First, rule
theorists have largely confined their theoretical and experimental work to the study of propositional reasoning and
have had rather little to say about syllogistic inference (but
see some discussion of reasoning with quantifiers by Rips,
1994). Second, the rale theories as published provide only
rules for valid inferences and hence can account for necessary but not possible inferences. We defer consideration of
how rule theories might be extended to the explanation of
possible inference until the General Discussion.
The account of human deduction in terms of mental
model theory was devised by Johnson-Laird (1983; JohnsonLaird & Byrne, 1991). In this approach, people do not prove
conclusions syntactically by applying valid inference rules.
Rather, their deductions are based on grasping a semantic
principle, namely, that a conclusion is valid if there is no
model of the premises that exclude it. The model theory
includes psychological constraints that do not apply to
formal semantic methods such as truth-table analysis. In
particular, it is supposed that people focus on situations in
which the premises would be true and represent such
situations selectively.
The mental model theory was originally devised as an
account of syllogistic reasoning (Johnson-Laird & Bara,
1984) and in its general form supposes that deduction
requires three stages:
1. Model formation. The reasoner forms an initial model
from the premises.
2. Conclusion formation. The reasoner derives a putative
conclusion from the model that is informative (e.g., not a
repetition of a premise).
3. Conclusion validation. The reasoner searches for a counterexample, that is, a model in which the premises are true but
the conclusion is false. If no such model is found, the
conclusion is valid.
A large experimental program of research has been
carried out by mental model theorists who claim support for
the predictions of their theory (see Johnson-Laird & Byrne,
1991). For example, Johnson-Laird and Bara (1984) ran a
(1)
(2)
(3)
1497
Universal affirmative
Universal negative
Particular affirmative
Particular negative
All X are Y
No X are Y
Some X are Y
Some X are not Y
1498
NoAareB
Some A are B
Some A are not B
All Bare A
No B are A
Some B are A
Some B are not A
Method
Design. Participants were run in two experimental groups
according to whether they received Necessity or Possibility instructions. Each evaluated the 28 immediate inference problems described above in an independently generated random order. Experiment 1 was the first task administered to these participants, who
then proceeded to cany out the tasks of Experiment 2, reported
below.
Participants. A total of 120 undergraduate students at the
University of Plymouth, Plymouth, England, took part in this study
and received payment for their participation. Participants were
randomly allocated to the two experimental groups, 60 in each. All
were familiar with the use of computers including the operation of
a mouse.
Materials. The instructions for the tasks were presented separately on sheets of A4 paper. However, the reasoning problems
were presented on an Acorn computer using a custom-written
computer program. A separate screen was used for each of the 28
Although latency measures were collected in these experiments, we decided not to report them. Interpretation of the latency
data was considered problematic for two main reasons. First, in the
large experiment (Experiment 2) people had to evaluate four
conclusions in relation to the premises pair on each screen with
only one latency recorded. Hence, we cannot separate the time
taken for reasoning about each conclusion. Second, there is much
variability of responding (our main measure of interest) associated
with different types of logical problems in all of the experiments, so
that overall latencies are based on a variable mix of yes and no
responses. There is no possibility of excluding "error" trials as
with a simple cognitive task. Given the multifactorial nature of the
designs, there is also no practical method of analyzing responses to
yes and no decisions separately. In addition to these main problems,
we are also of the view that psychologists currently lack a good
theory of how response latencies map onto cognitive processes
with problems of this complexity.
100
20-
Necessary
Possible
Impossible
1499
1500
A-B
B-C
B-A
C-B
Figure 3
A-B
C-B
Figure 4
B-A
B-C
Method
Design. Participants were run in four experimental groups
immediately following the presentation of the immediate inference
task reported as Experiment 1. Participants received the same kind
of experimental instruction (Necessity or Possibility) as they were
given in Experiment 1 but were subdivided according to whether
they received conclusions to evaluate in AC or CA order (see
introduction to this experiment). Each participant was shown 64
separate computer screens, one for each possible premise pair. For
each pair they were required to indicate whether each of four
possible conclusions was either necessary or possible according to
instruction group. The four possible conclusions were those in each
of the four moods and in an order (AC or CA) dependent on the
subgroup to which participants were assigned.
Participants. The same 120 students who participated in
Experiment 1 served as participants for Experiment 2, administered
immediately afterward.
Materials. Problems were presented in a similar form to those
of Experiment 1, except that there were two premises and a list of
four conclusions to be evaluated. An example screen layout is as
follows:
GIVEN THAT
Some T are P
No P are G
IS IT NECESSARY THAT
AllTareG
Some T are G
No T are G
Some T are not G
YES
D
NO
were told that there would be another series of logical problems but
that this time there will be two statements and that they would be
asked, given that these statements were true, to decide which of the
following statements must be true (Necessity group) or could be
true (Possibility group). They were shown an example of the screen
layout and were told to signal their answers by clicking the mouse
in the YES or NO box next to eaeh of the following statements.
They were told that they could decide about the statements in any
order but that a response once made could not be changed.
Whenever participants clicked in a box, it was filled on the
screen. When all four responses were made to a screen, a box
appeared underneath labeled CLICK HERE FOR THE NEXT
PROBLEM. Thus participants were self-paced and could rest
between problems in the long sequence as required. The program
recorded both the responses and the latencies and saved them to
disk. The 64 screens were presented in an independently randomized order for each participant.
Necessary
Possible
Impossible
1501
1502
1503
Table 1
Syllogisms Selected on the Basis of Inference Rates in Experiment 2 for Further
Investigation in Experiment 3
B-A
C-B
A-B
B-C
Syllogism
Necessary
Impossible
Possible strong
Possible weak
A-B
C-B
B-A
C-B
ac
ca
ac
ca
ac
ca
AAa
AEe
IAi
IEo
AEa
AEi
IAe
IE a
AOo
Hi
OAo
OOo
He
Ole
OEa
OOa
AEe
IAi
EAo
EIo
AAe
AEa
AEi
IAe
Ali
10 o
OAo
01 o
AOa
II a
IEa
OOa
Ali
AEo
IEo
EAe
AAe
Ale
IEa
EAa
AOo
IAi
II o
OAo
Ala
AOa
OAa
OOa
AAa
Ali
EAe
EIo
AAe
AAo
EAa
El a
Hi
10 o
OAo
OIo
AOa
IEa
EOa
OOa
AEe
IEo
EAe
OAo
AEa
AEi
EAa
OAa
AIo
IAi
IOo
OIo
Ala
IAe
II a
OEa
AEe
AOo
EAe
EIo
AEa
AOa
EAa
El a
Ali
IAi
IOo
OAo
IAa
IEa
EOa
Ola
ac
ca
Ali
AEo
IEo
EAe
AAe
Ale
IEa
EAa
AOo
IAi
II 0
OAo
Ala
AOa
OAa
OOa
AAa
Ali
EAe
EIo
AAe
AAo
EAa
El a
II i
IOo
OAo
OIo
AOa
IEa
EOa
OOa
Note. Uppercase letters represent premise pairs and lowercase represent conclusion. Key to
premise and conclusion types: A = All X are Y; E = No X are Y; I = Some X are Y; O = Some X are
notY.
groups of 20.
Materials and procedure. The computer program randomly
allocated letters (excluding I and O) for the end and middle terms
used in the syllogisms that were previously selected as shown in
Table 1. The screen layout used was similar to that of Experiment 1
except that two premises were given with a single conclusion to be
100 -,
80-
Table 2
Percentage of Conclusions Accepted in Experiment 3,
Broken Down by Problem Type, Figure, Conclusion Order,
and Instructional Group
Instruction and
problem type
20-
Necessity
Necessary
Impossible
Possible strong
Possible weak
M
Possibility
Necessary
Impossible
Possible strong
Possible weak
M
A-B
B-C
B-A
A-B
B-A
C-B
C-B
B-C
ac
ca
ac
ca
ac
ca
ac
ca
81
9
84
18
48
79
21
83
23
51
70
25
80
24
50
84
20
81
19
51
76
13
74
19
46
86
15
81
15
49
84
24
70
13
48
79
13
78
19
47
80
17
79
19
89
31
88
59
67
78
15
93
26
53
86
30
86
51
64
86
5
93
21
51
74
21
90
45
58
83
14
91
26
54
86
30
79
43
59
85
19
79
29
53
83
21
87
38
1505
1506
-,b
-,b
[b] c
[b] c
c
c
c
c
of the premises:
[a] b
b c
[a] b
b c
1507
1508
1509
Appendix A
Percentage Endorsements of Conclusions in Experiment 1
Premise
Conclusion
Logic
Necessity
Possibility
Some A are B
No A are B
Some A are not B
All B are A
Some B are A
No B are A
Some B are not A
N
I
I
P
N
I
P
65
3
10
57
72
17
42
82
12
7
85
80
32
52
Some A are B
All A are B
No A are B
Some A are not B
All Bare A
Some B are A
No Bare A
Some B are not A
P
I
P
P
N
I
P
3
8
92
5
82
22
85
53
55
97
53
95
50
97
No A are B
All A are B
Some A are B
Some A are not B
AH Bare A
Some B are A
No Bare A
Some B are not A
I
I
N
I
I
N
N
3
7
77
7
20
67
65
2
5
80
25
35
90
87
All A are B
Some A are B
No A are B
AH B are A
Some B are A
No Bare A
Some B are not A
I
P
P
P
P
P
P
2
87
5
7
70
12
88
3
97
48
38
95
53
95
All A are B
_
Note.
(Appendix B follows)
1510
Appendix B
Percentage Endorsement of Conclusions in Experimen 12 Under Necessity (N) and Possibility (P) Instructions
Cone.
Fig. order
Premises
A-C
All A are B
All B are C
C-A
All A are B
All B are C
A-C
All A are B
Some B are C
C-A
All A are B
Some B are C
A-C
Some A are B
All B are C
C-A
Some A are B
All B are C
A-C
Some A are B
Some B are C
C-A
Some A are B
Some B are C
A-C
No A are B
All B are C
C-A
No A are B
All B are C
A-C
No A are B
Some B are C
C-A
No A are B
Some B are C
A-C
C-A
A-C
C-A
Conclusion
Fig.
Cone.
order
All A are C
Some A are C
NoAareC
Some A are not C
All Care A
Some C are A
No Care A
Some C are not A
All A are C
Some A are C
NoAareC
Some A are not C
All C are A
Some C are A
No Care A
Some C are not A
All A are C
Some A are C
No A are C
Some A are not C
All Care A
Some C are A
No Care A
Some C are not A
All A are C
Some A are C
NoAareC
Some A are not C
All Care A
Some C are A
No C are A
Some C are not A
All A are C
Some A are C
NoAareC
Some A are not C
All C are A
Some C are A
No C are A
Some C are not A
All A are C
Some A are C
No A are C
Some A are not C
All Care A
Some C are A
No Care A
Some C are not A
All A are C
Some A are C
NoAareC
Some A are not C
All C are A
Some C are A
No C are A
Some C are not A
All A are C
Some A are C
NoAareC
Some A are not C
All Care A
Some C are A
No Care A
Some C are not A
N
N
I
I
P
N
I
P
P
P
P
P
P
P
P
P
P
N
I
P
P
N
I
P
P
P
P
P
P
P
P
P
P
P
P
P
I
P
P
N
P
P
P
P
I
P
P
N
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
73
27
10
23
77
47
80
53
27
13
83
63
27
40
30
83
33
87
33
90
20
80
23
90
20
87
37
90
20
83
33
100
50
93
47
87
50
93
20
17
83
73
23
27
80
57
27
60
77
80
20
50
63
67
27
87
37
93
10
87
43
90
20
93
43
80
33
83
53
83
A-C
All A are B
No B are C
C-A
All A are B
No B are C
A-C
All A are B
Some B are not C
C-A
All A are B
Some B are not C
A-C
Some A are B
No B are C
C-A
Some A are B
No B are C
A-C
Some A are B
Some B are not C
C-A
Some A are B
Some B are not C
A-C
NoAareB
No B are C
C-A
No A are B
No B are C
20
10
87
13
80
10
83
10
67
7
87
10
80
13
83
7
67
13
80
3
73
3
77
7
67
10
10
77
40
13
23
80
47
13
40
40
53
13
33
43
57
7
63
13
83
7
60
17
83
13
77
3
70
7
50
23
83
Premises
A-C
No A are B
Some B are not C
C-A
No A are B
Some B are not C
A-C
C-A
A-C
C-A
Conclusion
All A are C
Some A are C
No A are C
Some A are not C
All Care A
Some C are A
No C are A
Some C are not A
All A are C
Some A are C
NoAareC
Some A are not C
All Care A
Some C are A
No Care A
Some C are not A
All A are C
Some A are C
NoAareC
Some A are not C
All Care A
Some C are A
No C are A
Some C are not A
All A are C
Some A are C
NoAareC
Some A are not C
All Care A
Some C are A
No C are A
Some C are not A
All A are C
Some A are C
No A are C
Some A are not C
All Care A
Some C are A
No Care A
Some C are not A
All A are C
Some A are C
NoAareC
Some A are not C
All C are A
Some C are A
No Care A
Some C are not A
All A are C
Some A are C
NoAareC
Some A are not C
All Care A
Some C are A
No Care A
Some C are not A
All A are C
Some A are C
NoAareC
Some A are not C
All C are A
Some C are A
No C are A
Some C are not A
I
I
N
N
I
I
N
N
P
P
P
P
P
P
P
P
I
P
P
N
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
3 10
7 13
83 100
27 57
7 10
7 13
83 87
40 50
10 10
67 80
13 37
90 90
6 27
43 87
23 23
77 93
0
13
30 63
37 73
83 93
3 20
50 47
40 77
60 70
13 37
67 97
7 53
77 93
7 30
57 93
17 47
77 100
17 30
27 40
60 77
40 73
17 37
30 40
53 80
40 70
13 43
40 83
40 67
50 87
17 30
40 60
40 67
63 77
3 23
63 80
27 53
67 90
10 37
47 67
27 47
73 73
7 20
77 93
17 40
87 93
0 23
57 87
17 37
63 93
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
1511
Cone.
Fig. order
2
A-C
C-A
A-C
C-A
Premises
All Bare A
All C are B
All Bare A
All C are B "
All Bare A
Some C are B
All Bare A
Some C are B
A-C
Some B are A
All C are B
C-A
Some B are A
All C are B
A-C
Some B are A
Some C are B
C-A
Some B are A
Some C are B
A-C
No B are A
All C are B
C-A
No Bare A
All C are B
A-C
No Bare A
Some C are B
C-A
No B are A
Some C are B
A-C
C-A
A-C
C-A
Appendix B
(continued)
Conclusion
Fig.
Cone.
order
All A are C
Some A are C
NoAareC
Some A are not C
All Care A
Some C are A
No C are A
Some C are not A
All A are C
Some A are C
NoAareC
Some A are not C
All C are A
Some C are A
No Care A
Some C are not A
All A are C
Some A are C
NoAareC
Some A are not C
All Care A
Some C are A
No Care A
Some C are not A
All A are C
Some A are C
NoAareC
Some A are not C
All Care A
Some C are A
No Care A
Some C are not A
All A are C
Some A are C
NoAareC
Some A are not C
All Care A
Some C are A
No Care A
Some C are not A
All A are C
Some A are C
NoAareC
Some A are not C
All Care A
Some C are A
No Care A
Some C are not A
All A are C
Some A are C
NoAareC
Some A are not C
All Care A
Some C are A
No Care A
Some C are not A
All A are C
Some A are C
NoAareC
Some A are not C
All Care A
Some C are A
No C are A
Some C are not A
P
N
I
P
N
N
I
I
P
N
I
P
P
N
I
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
I
I
N
N
I
I
N
N
P
P
P
P
I
P
P
N
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
63 83
43 80
3
7
33 30
80 87
33 70
10 17
7 20
3 33
87 87
7 27
73 87
10 27
83 87
13 20
53 80
17 37
83 97
10 20
50 87
10 43
77 77
7 20
63 77
3 53
77 97
7 57
83 87
13 40
83 100
3 57
70 97
7 17
13 20
73 97
33 70
10 13
10 17
77 83
30 60
10 27
40 50
40 77
53 60
3 10
43 63
33 70
73 80
7 27
70 87
10 53
87 77
3 23
57 83
13 27
80 97
7 37
63 87
10 47
73 90
10 30
57 90
17 43
80 87
A-C
C-A
A-C
C-A
Premises
All Bare A
No C are B
All Bare A
No C are B
All Bare A
Some C are not B
All A are B
Some B are not C
A-C
Some B are A
No C are B
C-A
Some B are A
No C are B
A-C
Some B are A
Some C are not B
C-A
Some B are A
Some C are not B
A-C
No Bare A
No C are B
C-A
No B are A
No C are B
A-C
No B are A
Some C are not B
C-A
No B are A
Some C are not B
A-C
C-A
A-C
C-A
Conclusion
All A are C
Some A are C
NoAareC
Some A are not C
All Care A
Some C are A
No C are A
Some C are not A
All A are C
Some A are C
NoAareC
Some A are not C
All C are A
Some C are A
No Care A
Some C are not A
All A are C
Some A are C
NoAareC
Some A are not C
All Care A
Some C are A
No C are A
Some C are not A
All A are C
Some A are C
NoAareC
Some A are not C
All Care A
Some C are A
No Care A
Some C are not A
All A are C
Some A are C
No A are C
Some A are not C
All Care A
Some C are A
No Care A
Some C are not A
All A are C
Some A are C
NoAareC
Some A are not C
All Care A
Some C are A
No Care A
Some C are not A
All A are C
Some A are C
NoAareC
Some A are not C
All Care A
Some C are A
No Care A
Some C are not A
All A are C
Some A are C
NoAareC
Some A are not C
All Care A
Some C are A
No C are A
Some C are not A
I
P
P
N
P
P
P
P
P
P
P
P
P
P
P
P
I
P
P
N
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
17 20
17 30
23 80
27 67
10 27
20 37
70 80
47 60
7 17
70 93
10 53
93 93
3 17
53 87
20 23
70 90
10 20
27 47
57 83
50 83
0 27
20 63
60 70
67 77
10 30
60 100
7 47
73 93
3 33
57 87
7 43
77 93
17 30
27 30
53 93
33 67
23 37
23 47
53 83
37 63
10 40
53 80
27 67
53 77
0 17
47 53
27 83
53 77
10 27
47 60
30 73
53 70
10 23
30 53
37 63
43 57
3 27
80 90
13 43
80 90
0 20
67 97
7 50
77
87
1512
Appendix B
Cone.
Fig. order
3
A-C
C-A
Premises
All A are B
All C are B
All A are B
All C are B
A-C
All A are B
Some C are B
C-A
All A.are B
Some C are B
A-C
Some A are B
All C are B
C-A
Some A are B
All C are B
A-C
Some A are B
Some C are B
C-A
Some A are B
Some C are B
A-C
NoAareB
All C are B
C-A
No A are B
All C are B
A-C
NoAareB
Some C are B
C-A
No A are B
Some C are B
A-C
C-A
A-C
C-A
(continued)
Conclusion
Fig.
Cone.
order
AllAareC
Some A are C
No A are C
Some A are not C
All Care A
Some C are A
No Care A
Some C are not A
AllAareC
Some A are C
NoAareC
Some A are not C
All Care A
Some C are A
No Care A
Some C are not A
AllAareC
Some A are C
No A are C
Some A are not C
All Care A
Some C are A
NoCareA
Some C are not A
AllAareC
Some A are C
NoAareC
Some A are not C
All Care A
Some C are A
No C are A
Some C are not A
AllAareC
Some A are C
NoAareC
Some A are not C
All C are A
Some C are A
NoCareA
Some C are not A
AllAareC
Some A are C
NoAareC
Some A are not C
All Care A
Some C are A
NoCareA
Some C are not A
All A are C
Some A are C
No A are C
Some A are not C
All Care A
Some C are A
NoCareA
Some C are not A
AllAareC
Some A are C
NoAareC
Some A are not C
All Care A
Some C are A
NoCareA
Some C are not A
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
I
I
N
N
I
I
N
N
P
P
P
P
I
P
P
N
I
P
P
N
P
P
P
P
P
P
P
P
P
P
P
P
60
27
20
23
67
47
17
17
3
67
23
80
10
80
23
70
10
83
0
67
3
70
13
57
3
57
10
70
10
63
7
63
10
17
80
37
3
10
83
40
10
40
43
63
7
37
40
60
3
77
7
90
7
50
27
80
7
67
13
80
3
60
13
63
83
63
23
30
77
60
23
30
30
70
53
93
23
90
33
80
30
97
37
83
43
90
30
87
40
90
47
87
33
93
53
93
10
20
93
70
17
13
87
57
13
53
87
80
3
57
63
80
17
87
40
90
17
80
43
90
30
97
40
93
27
93
30
96
A-C
C-A
Premises
All A are B
No C are B
AllAareB
No C are B
A-C
AllAareB
Some C are not B
C-A
AllAareB
Some C are not B
A-C
Some A are B
No C are B
C-A
Some A are B
No C are B
A-C
Some A are B
Some C are not B
C-A
Some A are B
Some C are not B
A-C
NoAareB
No C are B
C-A
No A are B
No C are B
A-C
No A are B
Some C are not B
C-A
NoAareB
Some C are not B
A-C
C-A
A-C
C-A
Conclusion
All A are C
Some A are C
NoAareC
Some A are not C
All Care A
Some C are A
NoCareA
Some C are not A
AllAareC
Some A are C
NoAareC
Some A are not C
All Care A
Some C are A
No C are A
Some C are not A
AllAareC
Some A are C
No A are C
Some A are not C
All Care A
Some C are A
NoCareA
Some C are not A
AllAareC
Some A are C
NoAareC
Some A are not C
All C are A
Some C are A
NoCareA
Some C are not A
AllAareC
Some A are C
No A are C
Some A are not C
All Care A
Some C are A
NoCareA
Some C are not A
AllAareC
Some A are C
NoAareC
Some A are not C
All Care A
Some C are A
NoCareA
Some C are not A
AllAareC
Some A are C
No A are C
Some A are not C
All Care A
Some C are A
NoCareA
Some C are not A
AllAareC
Some A are C
No A are C
Some A are not C
All Care A
Some C are A
NoCareA
Some C are not A
I
I
N
N
I
I
N
N
P
P
P
P
I
P
P
N
I
P
P
N
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
3
7
7 20
83 87
33 63
7
13
7
17
80 80
37 60
10 17
67 80
13 47
80 87
0
10
57 73
17 43
80 83
13 17
37 63
33 80
63 77
0
17
37 53
43 80
40 73
10 23
63 97
13 57
80 90
7 43
63 87
7 57
73 83
10 60
27 63
43 77
3 77
17 57
20 57
40 77
27 67
13 27
50 63
33 80
57 73
3 13
43 60
30 77
50 70
3 27
33 80
27 50
53 83
7 30
47 63
30 70
67 67
13 40
53 93
13 57
73 100
3 43
57 100
13 33
60 87
1513
Appendix B
Fig.
Cone.
order
A-C
All Bare A
All B are C
C-A
All Bare A_
All B are C
A-C
All Bare A
Some B are C
C-A
All B are A
Some B are C
A-C
Some B are A
All B are C
C-A
Some B are A
All B are C
A-C
Some B are A
Some B are C
Premises
C-A
Some B are A
Some B are C
A-C
No Bare A
All B are C
C-A
No Bare A
All B are C
A-C
No B are A
Some B are C
C-A
No B are A
Some B are C
A-C
C-A
A-C
C-A
Note.
Conclusion
All A are C
Some A are C
NoAareC
Some A are not C
All Care A
Some C are A
No Care A
Some C are not A
All A are C
Some A are C
No A are C
Some A are not C
All Care A
Some C are A
No C are A
Some C are not A
All A are C
Some A are C
No A are C
Some A are not C
All Care A
Some C are A
No Care A
Some C are not A
All A are C
Some A are C
NoAareC
Some A are not C
All Care A
Some C are A
No Care A
Some C are not A
All A are C
Some A are C
NoAareC
Some A are not C
All Care A
Some C are A
No Care A
Some C are not A
All A are C
Some A are C
NoAareC
Some A are not C
All C are A
Some C are A
No Care A
Some C are not A
AllAareC
Some A are C
NoAareC
Some A are not C
All Care A
Some C are A
No Care A
Some C are not A
All A are C
Some A are C
NoAareC
Some A are not C
All Care A
Some C are A
No Care A
Some C are not A
P
N
I
P
P
N
I
P
P
N
I
P
P
N
I
P
P
N
I
P
P
N
I
P
P
P
P
P
P
P
P
P
P
P
P
P
I
P
P
N
P
P
P
P
I
P
P
N
P
P
P
P
I
P
P
N
P
P
P
P
P
P
P
P
{continued)
Fig.
Cone.
order
70
27
10
10
60
47
10
17
13
90
7
70
10
83
10
60
7
77
7
73
13
73
10
67
7
57
17
60
20
57
17
57
0
17
63
53
10
27
63
33
7
37
37
50
3
40
27
57
13
67
17
87
7
60
13
87
3
67
3
87
3
53
13
67
87
70
27
43
87
70
27
37
37
93
27
90
43
90
27
37
33
87
23
87
53
87
30
77
47
90
60
90
37
90
53
83
17
20
83
60
7
17
87
60
13
47
83
80
10
57
77
77
23
83
50
87
40
80
23
90
40
83
40
93
27
80
60
83
A-C
All Bare A
No B are C
C-A
All Bare A
No B are C
A-C
All Bare A
Some B are not C
C-A
All A are B
Some C are not B
A-C
Some B are A
No B are C
C-A
Some B are A
No B are C
A-C
Some B are A
Some B are not C
Premises
C-A
Some B are A
Some B are not C
A-C
No B are A
No B are C
C-A
No Bare A
No B are C
A-C
No Bare A
Some B are not C
C-A
No Bare A
Some B are not C
A-C
C-A
A-C
C-A
Conclusion
AllAareC
Some A are C
NoAareC
Some A are not C
All Care A
Some C are A
No Care A
Some C are not A
AllAareC
Some A are C
NoAareC
Some A are not C
All Care A
Some C are A
No Care A
Some C are not A
AllAareC
Some A are C
NoAareC
Some A are not C
All Care A
Some C are A
No C are A
Some C are not A
All A are C
Some A are C
NoAareC
Some A are not C
All Care A
Some C are A
No C are A
Some C are not A
AllAareC
Some A are C
NoAareC
Some A are not C
All Care A
Some C are A
No Care A
Some C are not A
AllAareC
Some A are C
No A are C
Some A are not C
All Care A
Some C are A
No Care A
Some C are not A
AllAareC
Some A are C
NoAareC
Some A are not C
All Care A
Some C are A
No Care A
Some C are not A
All A are C
Some A are C
NoAareC
Some A are not C
All Care A
Some C are A
No Care A
Some C are not A
I
P
P
N
P
P
P
P
I
P
P
N
P
P
P
P
I
P
P
N
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
P
7
20
63
30
7
20
73
37
7
63
13
87
0
53
17
83
7
30
30
70
7
30
47
53
20
17
93
70
13
27
90
67
30
87
40
83
20
80
27
87
23
60
80
83
20
60
77
83
33
87
43
90
33
87
47
93
60
50
80
77
53
57
80
73
43
70
67
83
23
57
63
77
37
60
67
70
23
57
70
83
40
93
60
97
43
93
53
90
70
7
80
0
57
13
67
20
17
47
23
23
30
43
27
13
40
33
53
13
37
43
50
13
43
33
50
13
37
40
47
13
57
13
53
3
53
17
60
Fig. = figure; Cone. = conclusion; L = logic (under which N = necessary; I = impossible; P = possible).