0% found this document useful (0 votes)
105 views13 pagesSpreadsheet (XLS) For 19OR24-rev5.pdf (Examples To Accompany "An Algorithm For Evaluating The Validity of Singly-Quantified Monadic Predicate Logic Arguments")
Spreadsheet (xls) for Examples To Accompany https://www.scribd.com/document/16240159/An-Algorithm-for-Evaluating-the-Validity-of-Singly-Quantified-Monadic-Predicate-Logic-Arguments (19OR24P-rev5.pdf; xls format); include cAmEnOs as requiring existential import; Corrections to Tables 2, 22, and 23, and the existentially quantified propositions of certain syllogisms (in symbols and words).
Uploaded by
Justine Leon A. UroCopyright
© Attribution ShareAlike (BY-SA)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLS, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
105 views13 pagesSpreadsheet (XLS) For 19OR24-rev5.pdf (Examples To Accompany "An Algorithm For Evaluating The Validity of Singly-Quantified Monadic Predicate Logic Arguments")
Spreadsheet (xls) for Examples To Accompany https://www.scribd.com/document/16240159/An-Algorithm-for-Evaluating-the-Validity-of-Singly-Quantified-Monadic-Predicate-Logic-Arguments (19OR24P-rev5.pdf; xls format); include cAmEnOs as requiring existential import; Corrections to Tables 2, 22, and 23, and the existentially quantified propositions of certain syllogisms (in symbols and words).
Uploaded by
Justine Leon A. UroCopyright
© Attribution ShareAlike (BY-SA)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLS, PDF, TXT or read online on Scribd
/ 13
15, 19, or 24 VALID Categorical Syllogisms
Table Figure Name
1 I bArbArA
2 I cElArEnt
3 I dArII
4 I fErIO
5 II cEsArE
6 II cAmEstrEs
7 II bArOcO
8 II fEstInO
9* III dArAptI
10 III dAtIsI
11 III dIsAmIs
12* III fElAptOn
13 III bOcArdO
14 III fErIsOn
15* IV brAmAntIp
16 IV dImArIs
17 IV cAmEnEs
18* IV fEsApO
19 IV frEsIsOn
20* I (from 1; bArbArI)
21* I (from 2; cElArOnt)
22* II (from 5; cEsArO))
23* II (from 6; cAmEstrOs)
24* IV (from 17; cAmEnOs)
*requires existential import (EI) for validity
I-AAA (bArbArA) III-OAO (bOcArdO)
All Q are R. ∃ ∃ ∃ ∀ ∀ ∀ Some Q are not R. ∃ ∃ ∃ ∃ ∀ ∃
All P are Q. P Q R Q => R P => Q P => R All Q are P. P Q R Q ^ ~R Q => P P ^ ~R
1 Therefore, all P are R. 1 1 1 1 1 1 1 13 Therefore, some P are not R. 1 1 1 1 0 1 0
2 1 1 0 0 1 0 2 1 1 0 1 1 1
(Vx)(Qx > Rx) 3 1 0 1 1 0 1 (3x)(Qx ^ ~Rx) 3 1 0 1 0 1 0
(Vx)(Px > Qx) 4 1 0 0 1 0 0 (Vx)(Qx > Px) 4 1 0 0 0 1 1
(Vx)(Px > Rx) 5 0 1 1 1 1 1 (3x)(Px ^ ~Rx) 5 0 1 1 0 0 0
6 0 1 0 0 1 1 6 0 1 0 1 0 0
7 0 0 1 1 1 1 7 0 0 1 0 1 0
8 0 0 0 1 1 1 8 0 0 0 0 1 0
I-EAE (cElArEnt) III-EIO (fErIsOn)
All Q are not R. ∃ ∃ ∃ ∀ ∀ ∀ All Q are not R. ∃ ∃ ∃ ∀ ∃ ∃
All P are Q. P Q R Q => ~R P => Q P => ~R Some Q are P. P Q R Q => ~R Q^P P ^ ~R
2 Therefore, all P are not R. 1 1 1 1 0 1 0 14 Therefore, some P are not R. 1 1 1 1 0 1 0
2 1 1 0 1 1 1 2 1 1 0 1 1 1
(Vx)(Qx > ~Rx) 3 1 0 1 1 0 0 (Vx)(Qx > ~Rx) 3 1 0 1 1 0 0
(Vx)(Px > Qx) 4 1 0 0 1 0 1 (3x)(Qx ^ Px) 4 1 0 0 1 0 1
(Vx)(Px > ~Rx) 5 0 1 1 0 1 1 (3x)(Px ^ ~Rx) 5 0 1 1 0 0 0
6 0 1 0 1 1 1 6 0 1 0 1 0 0
7 0 0 1 1 1 1 7 0 0 1 1 0 0
8 0 0 0 1 1 1 8 0 0 0 1 0 0
I-AII (dArII) IV-AAI (brAmAntIp)
All Q are R. ∃ ∃ ∃ ∀ ∃ ∃ All R are Q. ∃ ∃ ∃ ∀ ∀ ∃
Some P are Q. P Q R Q => R P^Q P^R All Q are P. P Q R R => Q Q => P P^R
3 Therefore, some P are R. 1 1 1 1 1 1 1 15 Therefore, some P are R. 1 1 1 1 1 1 1
2 1 1 0 0 1 0 2 1 1 0 1 1 0
(Vx)(Qx > Rx) 3 1 0 1 1 0 1 (Vx)(Rx > Qx) 3 1 0 1 0 1 1
(3x)(Px ^ Qx) 4 1 0 0 1 0 0 (Vx)(Qx > Px) 4 1 0 0 1 1 0
(3x)(Px ^ Rx) 5 0 1 1 1 0 0 (3x)(Px ^ Rx) 5 0 1 1 1 0 0
6 0 1 0 0 0 0 6 0 1 0 1 0 0
7 0 0 1 1 0 0 7 0 0 1 0 1 0
8 0 0 0 1 0 0 8 0 0 0 1 1 0
I-EIO (fErIO)
All Q are not R. ∃ ∃ ∃ ∀ ∃ ∃ IV-IAI (dImArIs) ∃ ∃ ∃ ∃ ∀ ∃
Some P are Q. P Q R Q => ~R P^Q P ^ ~R Some R are Q. P Q R R^Q Q => P P^R
4 Therefore, some P are not R. 1 1 1 1 0 1 0 16 All Q are P. 1 1 1 1 1 1 1
2 1 1 0 1 1 1 Therefore, some P are R. 2 1 1 0 0 1 0
(Vx)(Qx > ~Rx) 3 1 0 1 1 0 0 3 1 0 1 0 1 1
(3x)(Px ^ Qx) 4 1 0 0 1 0 1 (3x)(Rx ^ Qx) 4 1 0 0 0 1 0
(3x)(Px ^ ~Rx) 5 0 1 1 0 0 0 (Vx)(Qx > Px) 5 0 1 1 1 0 0
6 0 1 0 1 0 0 (3x)(Px ^ Rx) 6 0 1 0 0 0 0
7 0 0 1 1 0 0 7 0 0 1 0 1 0
8 0 0 0 1 0 0 8 0 0 0 0 1 0
II-EAE (cEsArE) IV-AEE (cAmEnEs)
All R are not Q. ∃ ∃ ∃ ∀ ∀ ∀ All R are Q. ∃ ∃ ∃ ∀ ∀ ∀
All P are Q. P Q R R => ~Q P => Q P => ~R All Q are not P. P Q R R => Q Q => ~P P => ~R
5 Therefore, all P are not R. 1 1 1 1 0 1 0 17 Therefore, all P are not R. 1 1 1 1 1 0 0
2 1 1 0 1 1 1 2 1 1 0 1 0 1
(Vx)(Rx > ~Qx) 3 1 0 1 1 0 0 (Vx)(Rx > Qx) 3 1 0 1 0 1 0
(Vx)(Px > Qx) 4 1 0 0 1 0 1 (Vx)(Qx > ~Px) 4 1 0 0 1 1 1
(Vx)(Px > ~Rx) 5 0 1 1 0 1 1 (Vx)(Px > ~Rx) 5 0 1 1 1 1 1
6 0 1 0 1 1 1 6 0 1 0 1 1 1
7 0 0 1 1 1 1 7 0 0 1 0 1 1
8 0 0 0 1 1 1 8 0 0 0 1 1 1
II-AEE (cAmEstrEs) IV-EAO (fEsApO)
All R are Q. ∃ ∃ ∃ ∀ ∀ ∀ All R are not Q. ∃ ∃ ∃ ∀ ∀ ∃
All P are not Q. P Q R R => Q P => ~Q P => ~R All Q are P. P Q R R => ~Q Q => P P ^ ~R
6 Therefore, all P are not R. 1 1 1 1 1 0 0 18 Therefore, some P are not R. 1 1 1 1 0 1 0
2 1 1 0 1 0 1 2 1 1 0 1 1 1
(Vx)(Rx > Qx) 3 1 0 1 0 1 0 (Vx)(Rx > ~Qx) 3 1 0 1 1 1 0
(Vx)(Px > ~Qx) 4 1 0 0 1 1 1 (Vx)(Qx > Px) 4 1 0 0 1 1 1
(Vx)(Px > ~Rx) 5 0 1 1 1 1 1 (3x)(Px ^ ~Rx) 5 0 1 1 0 0 0
6 0 1 0 1 1 1 6 0 1 0 1 0 0
7 0 0 1 0 1 1 7 0 0 1 1 1 0
8 0 0 0 1 1 1 8 0 0 0 1 1 0
II-AOO (bArOcO) IV-EIO (frEsIsOn)
All R are Q. ∃ ∃ ∃ ∀ ∃ ∃ All R are not Q. ∃ ∃ ∃ ∀ ∃ ∃
Some P are not Q. P Q R R => Q P ^ ~Q P ^ ~R Some Q are P. P Q R R => ~Q Q^P P ^ ~R
7 Therefore, some P are not R. 1 1 1 1 1 0 0 19 Therefore, some P are not R. 1 1 1 1 0 1 0
2 1 1 0 1 0 1 2 1 1 0 1 1 1
(Vx)(Rx > Qx) 3 1 0 1 0 1 0 (Vx)(Rx > ~Qx) 3 1 0 1 1 0 0
(3x)(Px ^ ~Qx) 4 1 0 0 1 1 1 (3x)(Qx ^ Px) 4 1 0 0 1 0 1
(3x)(Px ^ ~Rx) 5 0 1 1 1 0 0 (3x)(Px ^ ~Rx) 5 0 1 1 0 0 0
6 0 1 0 1 0 0 6 0 1 0 1 0 0
7 0 0 1 0 0 0 7 0 0 1 1 0 0
8 0 0 0 1 0 0 8 0 0 0 1 0 0
II-EIO (fEstInO) I-AAI (bArbArI)
All R are not Q. ∃ ∃ ∃ ∀ ∃ ∃ All Q are R. ∃ ∃ ∃ ∀ ∀ ∃
Some P are Q. P Q R R => ~Q P^Q P ^ ~R All P are Q. P Q R Q => R P => Q P^R
8 Therefore, some P are not R. 1 1 1 1 0 1 0 20 Therefore, some P are R. 1 1 1 1 1 1 1
2 1 1 0 1 1 1 2 1 1 0 0 1 0
(Vx)(Rx > ~Qx) 3 1 0 1 1 0 0 (Vx)(Qx > Rx) 3 1 0 1 1 0 1
(3x)(Px ^ Qx) 4 1 0 0 1 0 1 (Vx)(Px > Qx) 4 1 0 0 1 0 0
(3x)(Px ^ ~Rx) 5 0 1 1 0 0 0 (3x)(Px ^ Rx) 5 0 1 1 1 1 0
6 0 1 0 1 0 0 6 0 1 0 0 1 0
7 0 0 1 1 0 0 7 0 0 1 1 1 0
8 0 0 0 1 0 0 8 0 0 0 1 1 0
III-AAI (dArAPtI) I-EAO (cElArOnt)
All Q are R. ∃ ∃ ∃ ∀ ∀ ∃ All Q are not R. ∃ ∃ ∃ ∀ ∀ ∃
All Q are P. P Q R Q => R Q => P P^R All P are Q. P Q R Q => ~R P => Q P ^ ~R
9 Therefore, some P are R. 1 1 1 1 1 1 1 21 Therefore, some P are not R. 1 1 1 1 0 1 0
2 1 1 0 0 1 0 2 1 1 0 1 1 1
(Vx)(Qx > Rx) 3 1 0 1 1 1 1 (Vx)(Qx > ~Rx) 3 1 0 1 1 0 0
(Vx)(Qx > Px) 4 1 0 0 1 1 0 (Vx)(Px > Qx) 4 1 0 0 1 0 1
(3x)(Px ^ Rx) 5 0 1 1 1 0 0 (3x)(Px ^ ~Rx) 5 0 1 1 0 1 0
6 0 1 0 0 0 0 6 0 1 0 1 1 0
7 0 0 1 1 1 0 7 0 0 1 1 1 0
8 0 0 0 1 1 0 8 0 0 0 1 1 0
III-AII (dAtIsI) II-EAO (cEsArO)
All Q are R. ∃ ∃ ∃ ∀ ∃ ∃ All R are not Q. ∃ ∃ ∃ ∀ ∀ ∃
Some Q are P. P Q R Q => R Q^P P^R All P are Q. P Q R R => ~Q P => Q P ^ ~R
10 Therefore, some P are R. 1 1 1 1 1 1 1 22 Therefore, some P are not R. 1 1 1 1 0 1 0
2 1 1 0 0 1 0 2 1 1 0 1 1 1
(Vx)(Qx > Rx) 3 1 0 1 1 0 1 (Vx)(Rx > ~Qx) 3 1 0 1 1 0 0
(3x)(Qx ^ Px) 4 1 0 0 1 0 0 (Vx)(Px > Qx) 4 1 0 0 1 0 1
(3x)(Px ^ Rx) 5 0 1 1 1 0 0 (3x)(Px ^ ~Rx) 5 0 1 1 0 1 0
6 0 1 0 0 0 0 6 0 1 0 1 1 0
7 0 0 1 1 0 0 7 0 0 1 1 1 0
8 0 0 0 1 0 0 8 0 0 0 1 1 0
III-IAI (dIsAmIs) II-AEO (cAmEstrOs)
Some Q are R. ∃ ∃ ∃ ∃ ∀ ∃ All R are Q. ∃ ∃ ∃ ∀ ∀ ∃
All Q are P. P Q R Q^R Q => P P^R All P are not Q. P Q R R => Q P => ~Q P ^ ~R
11 Therefore, some P are R. 1 1 1 1 1 1 1 23 Therefore, some P are not R. 1 1 1 1 1 0 0
2 1 1 0 0 1 0 2 1 1 0 1 0 1
(3x)(Qx ^ Rx) 3 1 0 1 0 1 1 (Vx)(Rx > Qx) 3 1 0 1 0 1 0
(Vx)(Qx > Px) 4 1 0 0 0 1 0 (Vx)(Px > ~Qx) 4 1 0 0 1 1 1
(3x)(Px ^ Rx) 5 0 1 1 1 0 0 (3x)(Px ^ ~Rx) 5 0 1 1 1 1 0
6 0 1 0 0 0 0 6 0 1 0 1 1 0
7 0 0 1 0 1 0 7 0 0 1 0 1 0
8 0 0 0 0 1 0 8 0 0 0 1 1 0
III-EAO (fElAptOn) IV-AEO (cAmEnOs)
All Q are not R. ∃ ∃ ∃ ∀ ∀ ∃ All R are Q. ∃ ∃ ∃ ∀ ∀ ∃
All Q are P. P Q R Q => ~R Q => P P ^ ~R All Q are not P. P Q R R => Q Q => ~P P ^ ~R
12 Therefore, some P are not R. 1 1 1 1 0 1 0 24 Therefore, some P are not R. 1 1 1 1 1 0 0
2 1 1 0 1 1 1 2 1 1 0 1 0 1
(Vx)(Qx > ~Rx) 3 1 0 1 1 1 0 (Vx)(Rx > Qx) 3 1 0 1 0 1 0
(Vx)(Qx > Px) 4 1 0 0 1 1 1 (Vx)(Qx > ~Px) 4 1 0 0 1 1 1
(3x)(Px ^ ~Rx) 5 0 1 1 0 0 0 (3x)(Px ^ ~Rx) 5 0 1 1 1 1 0
6 0 1 0 1 0 0 6 0 1 0 1 1 0
7 0 0 1 1 1 0 7 0 0 1 0 1 0
8 0 0 0 1 1 0 8 0 0 0 1 1 0
I-AAA (bArbArA) III-OAO (bOcArdO)
All Q are R. ∃ ∃ ∃ ∀ ∀ ∀ Some Q are not R. ∃ ∃ ∃ ∃ ∀ ∃
All P are Q. P Q R Q => R P => Q P => R All Q are P. P Q R Q ^ ~R Q => P P ^ ~R
1 Therefore, all P are R. 1 1 1 1 TRUE TRUE TRUE 13 Therefore, some P are not R. 1 1 1 1 FALSE TRUE FALSE
2 1 1 0 FALSE TRUE FALSE 2 1 1 0 TRUE TRUE TRUE
(Vx)(Qx > Rx) 3 1 0 1 TRUE FALSE TRUE (3x)(Qx ^ ~Rx) 3 1 0 1 FALSE TRUE FALSE
(Vx)(Px > Qx) 4 1 0 0 TRUE FALSE FALSE (Vx)(Qx > Px) 4 1 0 0 FALSE TRUE TRUE
(Vx)(Px > Rx) 5 0 1 1 TRUE TRUE TRUE (3x)(Px ^ ~Rx) 5 0 1 1 FALSE FALSE FALSE
6 0 1 0 FALSE TRUE TRUE 6 0 1 0 TRUE FALSE FALSE
7 0 0 1 TRUE TRUE TRUE 7 0 0 1 FALSE TRUE FALSE
8 0 0 0 TRUE TRUE TRUE 8 0 0 0 FALSE TRUE FALSE
I-EAE (cElArEnt) III-EIO (fErIsOn)
All Q are not R. ∃ ∃ ∃ ∀ ∀ ∀ All Q are not R. ∃ ∃ ∃ ∀ ∃ ∃
All P are Q. P Q R Q => ~R P => Q P => ~R Some Q are P. P Q R Q => ~R Q^P P ^ ~R
2 Therefore, all P are not R. 1 1 1 1 FALSE TRUE FALSE 14 Therefore, some P are not R. 1 1 1 1 FALSE TRUE FALSE
2 1 1 0 TRUE TRUE TRUE 2 1 1 0 TRUE TRUE TRUE
(Vx)(Qx > ~Rx) 3 1 0 1 TRUE FALSE FALSE (Vx)(Qx > ~Rx) 3 1 0 1 TRUE FALSE FALSE
(Vx)(Px > Qx) 4 1 0 0 TRUE FALSE TRUE (3x)(Qx ^ Px) 4 1 0 0 TRUE FALSE TRUE
(Vx)(Px > ~Rx) 5 0 1 1 FALSE TRUE TRUE (3x)(Px ^ ~Rx) 5 0 1 1 FALSE FALSE FALSE
6 0 1 0 TRUE TRUE TRUE 6 0 1 0 TRUE FALSE FALSE
7 0 0 1 TRUE TRUE TRUE 7 0 0 1 TRUE FALSE FALSE
8 0 0 0 TRUE TRUE TRUE 8 0 0 0 TRUE FALSE FALSE
I-AII (dArII) IV-AAI (brAmAntIp)
All Q are R. ∃ ∃ ∃ ∀ ∃ ∃ All R are Q. ∃ ∃ ∃ ∀ ∀ ∃
Some P are Q. P Q R Q => R P^Q P^R All Q are P. P Q R R => Q Q => P P^R
3 Therefore, some P are R. 1 1 1 1 TRUE TRUE TRUE 15 Therefore, some P are R. 1 1 1 1 TRUE TRUE TRUE
2 1 1 0 FALSE TRUE FALSE 2 1 1 0 TRUE TRUE FALSE
(Vx)(Qx > Rx) 3 1 0 1 TRUE FALSE TRUE (Vx)(Rx > Qx) 3 1 0 1 FALSE TRUE TRUE
(3x)(Px ^ Qx) 4 1 0 0 TRUE FALSE FALSE (Vx)(Qx > Px) 4 1 0 0 TRUE TRUE FALSE
(3x)(Px ^ Rx) 5 0 1 1 TRUE FALSE FALSE (3x)(Px ^ Rx) 5 0 1 1 TRUE FALSE FALSE
6 0 1 0 FALSE FALSE FALSE 6 0 1 0 TRUE FALSE FALSE
7 0 0 1 TRUE FALSE FALSE 7 0 0 1 FALSE TRUE FALSE
8 0 0 0 TRUE FALSE FALSE 8 0 0 0 TRUE TRUE FALSE
I-EIO (fErIO)
All Q are not R. ∃ ∃ ∃ ∀ ∃ ∃ IV-IAI (dImArIs) ∃ ∃ ∃ ∃ ∀ ∃
Some P are Q. P Q R Q => ~R P^Q P ^ ~R Some R are Q. P Q R R^Q Q => P P^R
4 Therefore, some P are not R. 1 1 1 1 FALSE TRUE FALSE 16 All Q are P. 1 1 1 1 TRUE TRUE TRUE
2 1 1 0 TRUE TRUE TRUE Therefore, some P are R. 2 1 1 0 FALSE TRUE FALSE
(Vx)(Qx > ~Rx) 3 1 0 1 TRUE FALSE FALSE 3 1 0 1 FALSE TRUE TRUE
(3x)(Px ^ Qx) 4 1 0 0 TRUE FALSE TRUE (3x)(Rx ^ Qx) 4 1 0 0 FALSE TRUE FALSE
(3x)(Px ^ ~Rx) 5 0 1 1 FALSE FALSE FALSE (Vx)(Qx > Px) 5 0 1 1 TRUE FALSE FALSE
6 0 1 0 TRUE FALSE FALSE (3x)(Px ^ Rx) 6 0 1 0 FALSE FALSE FALSE
7 0 0 1 TRUE FALSE FALSE 7 0 0 1 FALSE TRUE FALSE
8 0 0 0 TRUE FALSE FALSE 8 0 0 0 FALSE TRUE FALSE
II-EAE (cEsArE) IV-AEE (cAmEnEs)
All R are not Q. ∃ ∃ ∃ ∀ ∀ ∀ All R are Q. ∃ ∃ ∃ ∀ ∀ ∀
All P are Q. P Q R R => ~Q P => Q P => ~R All Q are not P. P Q R R => Q Q => ~P P => ~R
5 Therefore, all P are not R. 1 1 1 1 FALSE TRUE FALSE 17 Therefore, all P are not R. 1 1 1 1 TRUE FALSE FALSE
2 1 1 0 TRUE TRUE TRUE 2 1 1 0 TRUE FALSE TRUE
(Vx)(Rx > ~Qx) 3 1 0 1 TRUE FALSE FALSE (Vx)(Rx > Qx) 3 1 0 1 FALSE TRUE FALSE
(Vx)(Px > Qx) 4 1 0 0 TRUE FALSE TRUE (Vx)(Qx > ~Px) 4 1 0 0 TRUE TRUE TRUE
(Vx)(Px > ~Rx) 5 0 1 1 FALSE TRUE TRUE (Vx)(Px > ~Rx) 5 0 1 1 TRUE TRUE TRUE
6 0 1 0 TRUE TRUE TRUE 6 0 1 0 TRUE TRUE TRUE
7 0 0 1 TRUE TRUE TRUE 7 0 0 1 FALSE TRUE TRUE
8 0 0 0 TRUE TRUE TRUE 8 0 0 0 TRUE TRUE TRUE
II-AEE (cAmEstrEs) IV-EAO (fEsApO)
All R are Q. ∃ ∃ ∃ ∀ ∀ ∀ All R are not Q. ∃ ∃ ∃ ∀ ∀ ∃
All P are not Q. P Q R R => Q P => ~Q P => ~R All Q are P. P Q R R => ~Q Q => P P ^ ~R
6 Therefore, all P are not R. 1 1 1 1 TRUE FALSE FALSE 18 Therefore, some P are not R. 1 1 1 1 FALSE TRUE FALSE
2 1 1 0 TRUE FALSE TRUE 2 1 1 0 TRUE TRUE TRUE
(Vx)(Rx > Qx) 3 1 0 1 FALSE TRUE FALSE (Vx)(Rx > ~Qx) 3 1 0 1 TRUE TRUE FALSE
(Vx)(Px > ~Qx) 4 1 0 0 TRUE TRUE TRUE (Vx)(Qx > Px) 4 1 0 0 TRUE TRUE TRUE
(Vx)(Px > ~Rx) 5 0 1 1 TRUE TRUE TRUE (3x)(Px ^ ~Rx) 5 0 1 1 FALSE FALSE FALSE
6 0 1 0 TRUE TRUE TRUE 6 0 1 0 TRUE FALSE FALSE
7 0 0 1 FALSE TRUE TRUE 7 0 0 1 TRUE TRUE FALSE
8 0 0 0 TRUE TRUE TRUE 8 0 0 0 TRUE TRUE FALSE
II-AOO (bArOcO) IV-EIO (frEsIsOn)
All R are Q. ∃ ∃ ∃ ∀ ∃ ∃ All R are not Q. ∃ ∃ ∃ ∀ ∃ ∃
Some P are not Q. P Q R R => Q P ^ ~Q P ^ ~R Some Q are P. P Q R R => ~Q Q^P P ^ ~R
7 Therefore, some P are not R. 1 1 1 1 TRUE FALSE FALSE 19 Therefore, some P are not R. 1 1 1 1 FALSE TRUE FALSE
2 1 1 0 TRUE FALSE TRUE 2 1 1 0 TRUE TRUE TRUE
(Vx)(Rx > Qx) 3 1 0 1 FALSE TRUE FALSE (Vx)(Rx > ~Qx) 3 1 0 1 TRUE FALSE FALSE
(3x)(Px ^ ~Qx) 4 1 0 0 TRUE TRUE TRUE (3x)(Qx ^ Px) 4 1 0 0 TRUE FALSE TRUE
(3x)(Px ^ ~Rx) 5 0 1 1 TRUE FALSE FALSE (3x)(Px ^ ~Rx) 5 0 1 1 FALSE FALSE FALSE
6 0 1 0 TRUE FALSE FALSE 6 0 1 0 TRUE FALSE FALSE
7 0 0 1 FALSE FALSE FALSE 7 0 0 1 TRUE FALSE FALSE
8 0 0 0 TRUE FALSE FALSE 8 0 0 0 TRUE FALSE FALSE
II-EIO (fEstInO) I-AAI (bArbArI)
All R are not Q. ∃ ∃ ∃ ∀ ∃ ∃ All Q are R. ∃ ∃ ∃ ∀ ∀ ∃
Some P are Q. P Q R R => ~Q P^Q P ^ ~R All P are Q. P Q R Q => R P => Q P^R
8 Therefore, some P are not R. 1 1 1 1 FALSE TRUE FALSE 20 Therefore, some P are R. 1 1 1 1 TRUE TRUE TRUE
2 1 1 0 TRUE TRUE TRUE 2 1 1 0 FALSE TRUE FALSE
(Vx)(Rx > ~Qx) 3 1 0 1 TRUE FALSE FALSE (Vx)(Qx > Rx) 3 1 0 1 TRUE FALSE TRUE
(3x)(Px ^ Qx) 4 1 0 0 TRUE FALSE TRUE (Vx)(Px > Qx) 4 1 0 0 TRUE FALSE FALSE
(3x)(Px ^ ~Rx) 5 0 1 1 FALSE FALSE FALSE (3x)(Px ^ Rx) 5 0 1 1 TRUE TRUE FALSE
6 0 1 0 TRUE FALSE FALSE 6 0 1 0 FALSE TRUE FALSE
7 0 0 1 TRUE FALSE FALSE 7 0 0 1 TRUE TRUE FALSE
8 0 0 0 TRUE FALSE FALSE 8 0 0 0 TRUE TRUE FALSE
III-AAI (dArAPtI) I-EAO (cElArOnt)
All Q are R. ∃ ∃ ∃ ∀ ∀ ∃ All Q are not R. ∃ ∃ ∃ ∀ ∀ ∃
All Q are P. P Q R Q => R Q => P P^R All P are Q. P Q R Q => ~R P => Q P ^ ~R
9 Therefore, some P are R. 1 1 1 1 TRUE TRUE TRUE 21 Therefore, some P are not R. 1 1 1 1 FALSE TRUE FALSE
2 1 1 0 FALSE TRUE FALSE 2 1 1 0 TRUE TRUE TRUE
(Vx)(Qx > Rx) 3 1 0 1 TRUE TRUE TRUE (Vx)(Qx > ~Rx) 3 1 0 1 TRUE FALSE FALSE
(Vx)(Qx > Px) 4 1 0 0 TRUE TRUE FALSE (Vx)(Px > Qx) 4 1 0 0 TRUE FALSE TRUE
(3x)(Px ^ Rx) 5 0 1 1 TRUE FALSE FALSE (3x)(Px ^ ~Rx) 5 0 1 1 FALSE TRUE FALSE
6 0 1 0 FALSE FALSE FALSE 6 0 1 0 TRUE TRUE FALSE
7 0 0 1 TRUE TRUE FALSE 7 0 0 1 TRUE TRUE FALSE
8 0 0 0 TRUE TRUE FALSE 8 0 0 0 TRUE TRUE FALSE
III-AII (dAtIsI) II-EAO (cEsArO)
All Q are R. ∃ ∃ ∃ ∀ ∃ ∃ All R are not Q. ∃ ∃ ∃ ∀ ∀ ∃
Some Q are P. P Q R Q => R Q^P P^R All P are Q. P Q R R => ~Q P => Q P ^ ~R
10 Therefore, some P are R. 1 1 1 1 TRUE TRUE TRUE 22 Therefore, some P are not R. 1 1 1 1 FALSE TRUE FALSE
2 1 1 0 FALSE TRUE FALSE 2 1 1 0 TRUE TRUE TRUE
(Vx)(Qx > Rx) 3 1 0 1 TRUE FALSE TRUE (Vx)(Rx > ~Qx) 3 1 0 1 TRUE FALSE FALSE
(3x)(Qx ^ Px) 4 1 0 0 TRUE FALSE FALSE (Vx)(Px > Qx) 4 1 0 0 TRUE FALSE TRUE
(3x)(Px ^ Rx) 5 0 1 1 TRUE FALSE FALSE (3x)(Px ^ ~Rx) 5 0 1 1 FALSE TRUE FALSE
6 0 1 0 FALSE FALSE FALSE 6 0 1 0 TRUE TRUE FALSE
7 0 0 1 TRUE FALSE FALSE 7 0 0 1 TRUE TRUE FALSE
8 0 0 0 TRUE FALSE FALSE 8 0 0 0 TRUE TRUE FALSE
III-IAI (dIsAmIs) II-AEO (cAmEstrOs)
Some Q are R. ∃ ∃ ∃ ∃ ∀ ∃ All R are Q. ∃ ∃ ∃ ∀ ∀ ∃
All Q are P. P Q R Q^R Q => P P^R All P are not Q. P Q R R => Q P => ~Q P ^ ~R
11 Therefore, some P are R. 1 1 1 1 TRUE TRUE TRUE 23 Therefore, some P are not R. 1 1 1 1 TRUE FALSE FALSE
2 1 1 0 FALSE TRUE FALSE 2 1 1 0 TRUE FALSE TRUE
(3x)(Qx ^ Rx) 3 1 0 1 FALSE TRUE TRUE (Vx)(Rx > Qx) 3 1 0 1 FALSE TRUE FALSE
(Vx)(Qx > Px) 4 1 0 0 FALSE TRUE FALSE (Vx)(Px > ~Qx) 4 1 0 0 TRUE TRUE TRUE
(3x)(Px ^ Rx) 5 0 1 1 TRUE FALSE FALSE (3x)(Px ^ ~Rx) 5 0 1 1 TRUE TRUE FALSE
6 0 1 0 FALSE FALSE FALSE 6 0 1 0 TRUE TRUE FALSE
7 0 0 1 FALSE TRUE FALSE 7 0 0 1 FALSE TRUE FALSE
8 0 0 0 FALSE TRUE FALSE 8 0 0 0 TRUE TRUE FALSE
III-EAO (fElAptOn) IV-AEO (cAmEnOs)
All Q are not R. ∃ ∃ ∃ ∀ ∀ ∃ All R are Q. ∃ ∃ ∃ ∀ ∀ ∃
All Q are P. P Q R Q => ~R Q => P P ^ ~R All Q are not P. P Q R R => Q Q => ~P P ^ ~R
12 Therefore, some P are not R. 1 1 1 1 FALSE TRUE FALSE 24 Therefore, some P are not R. 1 1 1 1 TRUE FALSE FALSE
2 1 1 0 TRUE TRUE TRUE 2 1 1 0 TRUE FALSE TRUE
(Vx)(Qx > ~Rx) 3 1 0 1 TRUE TRUE FALSE (Vx)(Rx > Qx) 3 1 0 1 FALSE TRUE FALSE
(Vx)(Qx > Px) 4 1 0 0 TRUE TRUE TRUE (Vx)(Qx > ~Px) 4 1 0 0 TRUE TRUE TRUE
(3x)(Px ^ ~Rx) 5 0 1 1 FALSE FALSE FALSE (3x)(Px ^ ~Rx) 5 0 1 1 TRUE TRUE FALSE
6 0 1 0 TRUE FALSE FALSE 6 0 1 0 TRUE TRUE FALSE
7 0 0 1 TRUE TRUE FALSE 7 0 0 1 FALSE TRUE FALSE
8 0 0 0 TRUE TRUE FALSE 8 0 0 0 TRUE TRUE FALSE
I-AAA (bArbArA) III-OAO (bOcArdO)
All Q are R. ∃ ∃ ∃ ∀ ∀ ∀ Some Q are not R. ∃ ∃ ∃ ∃ ∀ ∃
All P are Q. P Q R Q => R P => Q P => R All Q are P. P Q R Q ^ ~R Q => P P ^ ~R
1 Therefore, all P are R. 1 1 1 1 1 1 1 13 Therefore, some P are not R. 1 1 1 1 0 1 0
2 1 1 0 0 1 0 2 1 1 0 1 1 1
(Vx)(Qx > Rx) 3 1 0 1 1 0 1 (3x)(Qx ^ ~Rx) 3 1 0 1 0 1 0
(Vx)(Px > Qx) 4 1 0 0 1 0 0 (Vx)(Qx > Px) 4 1 0 0 0 1 1
(Vx)(Px > Rx) 5 0 1 1 1 1 1 (3x)(Px ^ ~Rx) 5 0 1 1 0 0 0
6 0 1 0 0 1 1 6 0 1 0 1 0 0
7 0 0 1 1 1 1 7 0 0 1 0 1 0
8 0 0 0 1 1 1 8 0 0 0 0 1 0
I-EAE (cElArEnt) III-EIO (fErIsOn)
All Q are not R. ∃ ∃ ∃ ∀ ∀ ∀ All Q are not R. ∃ ∃ ∃ ∀ ∃ ∃
All P are Q. P Q R Q => ~R P => Q P => ~R Some Q are P. P Q R Q => ~R Q^P P ^ ~R
2 Therefore, all P are not R. 1 1 1 1 0 1 0 14 Therefore, some P are not R. 1 1 1 1 0 1 0
2 1 1 0 1 1 1 2 1 1 0 1 1 1
(Vx)(Qx > ~Rx) 3 1 0 1 1 0 0 (Vx)(Qx > ~Rx) 3 1 0 1 1 0 0
(Vx)(Px > Qx) 4 1 0 0 1 0 1 (3x)(Qx ^ Px) 4 1 0 0 1 0 1
(Vx)(Px > ~Rx) 5 0 1 1 0 1 1 (3x)(Px ^ ~Rx) 5 0 1 1 0 0 0
6 0 1 0 1 1 1 6 0 1 0 1 0 0
7 0 0 1 1 1 1 7 0 0 1 1 0 0
8 0 0 0 1 1 1 8 0 0 0 1 0 0
I-AII (dArII) IV-AAI (brAmAntIp)
All Q are R. ∃ ∃ ∃ ∀ ∃ ∃ All R are Q. ∃ ∃ ∃ ∀ ∀ ∃
Some P are Q. P Q R Q => R P^Q P^R All Q are P. P Q R R => Q Q => P P^R
3 Therefore, some P are R. 1 1 1 1 1 1 1 15 Therefore, some P are R. 1 1 1 1 1 1 1
2 1 1 0 0 1 0 2 1 1 0 1 1 0
(Vx)(Qx > Rx) 3 1 0 1 1 0 1 (Vx)(Rx > Qx) 3 1 0 1 0 1 1
(3x)(Px ^ Qx) 4 1 0 0 1 0 0 (Vx)(Qx > Px) 4 1 0 0 1 1 0
(3x)(Px ^ Rx) 5 0 1 1 1 0 0 (3x)(Px ^ Rx) 5 0 1 1 1 0 0
6 0 1 0 0 0 0 6 0 1 0 1 0 0
7 0 0 1 1 0 0 7 0 0 1 0 1 0
8 0 0 0 1 0 0 8 0 0 0 1 1 0
I-EIO (fErIO)
All Q are not R. ∃ ∃ ∃ ∀ ∃ ∃ IV-IAI (dImArIs) ∃ ∃ ∃ ∃ ∀ ∃
Some P are Q. P Q R Q => ~R P^Q P ^ ~R Some R are Q. P Q R R^Q Q => P P^R
4 Therefore, some P are not R. 1 1 1 1 0 1 0 16 All Q are P. 1 1 1 1 1 1 1
2 1 1 0 1 1 1 Therefore, some P are R. 2 1 1 0 0 1 0
(Vx)(Qx > ~Rx) 3 1 0 1 1 0 0 3 1 0 1 0 1 1
(3x)(Px ^ Qx) 4 1 0 0 1 0 1 (3x)(Rx ^ Qx) 4 1 0 0 0 1 0
(3x)(Px ^ ~Rx) 5 0 1 1 0 0 0 (Vx)(Qx > Px) 5 0 1 1 1 0 0
6 0 1 0 1 0 0 (3x)(Px ^ Rx) 6 0 1 0 0 0 0
7 0 0 1 1 0 0 7 0 0 1 0 1 0
8 0 0 0 1 0 0 8 0 0 0 0 1 0
II-EAE (cEsArE) IV-AEE (cAmEnEs)
All R are not Q. ∃ ∃ ∃ ∀ ∀ ∀ All R are Q. ∃ ∃ ∃ ∀ ∀ ∀
All P are Q. P Q R R => ~Q P => Q P => ~R All Q are not P. P Q R R => Q Q => ~P P => ~R
5 Therefore, all P are not R. 1 1 1 1 0 1 0 17 Therefore, all P are not R. 1 1 1 1 1 0 0
2 1 1 0 1 1 1 2 1 1 0 1 0 1
(Vx)(Rx > ~Qx) 3 1 0 1 1 0 0 (Vx)(Rx > Qx) 3 1 0 1 0 1 0
(Vx)(Px > Qx) 4 1 0 0 1 0 1 (Vx)(Qx > ~Px) 4 1 0 0 1 1 1
(Vx)(Px > ~Rx) 5 0 1 1 0 1 1 (Vx)(Px > ~Rx) 5 0 1 1 1 1 1
6 0 1 0 1 1 1 6 0 1 0 1 1 1
7 0 0 1 1 1 1 7 0 0 1 0 1 1
8 0 0 0 1 1 1 8 0 0 0 1 1 1
II-AEE (cAmEstrEs) IV-EAO (fEsApO)
All R are Q. ∃ ∃ ∃ ∀ ∀ ∀ All R are not Q. ∃ ∃ ∃ ∀ ∀ ∃
All P are not Q. P Q R R => Q P => ~Q P => ~R All Q are P. P Q R R => ~Q Q => P P ^ ~R
6 Therefore, all P are not R. 1 1 1 1 1 0 0 18 Therefore, some P are not R. 1 1 1 1 0 1 0
2 1 1 0 1 0 1 2 1 1 0 1 1 1
(Vx)(Rx > Qx) 3 1 0 1 0 1 0 (Vx)(Rx > ~Qx) 3 1 0 1 1 1 0
(Vx)(Px > ~Qx) 4 1 0 0 1 1 1 (Vx)(Qx > Px) 4 1 0 0 1 1 1
(Vx)(Px > ~Rx) 5 0 1 1 1 1 1 (3x)(Px ^ ~Rx) 5 0 1 1 0 0 0
6 0 1 0 1 1 1 6 0 1 0 1 0 0
7 0 0 1 0 1 1 7 0 0 1 1 1 0
8 0 0 0 1 1 1 8 0 0 0 1 1 0
II-AOO (bArOcO) IV-EIO (frEsIsOn)
All R are Q. ∃ ∃ ∃ ∀ ∃ ∃ All R are not Q. ∃ ∃ ∃ ∀ ∃ ∃
Some P are not Q. P Q R R => Q P ^ ~Q P ^ ~R Some Q are P. P Q R R => ~Q Q^P P ^ ~R
7 Therefore, some P are not R. 1 1 1 1 1 0 0 19 Therefore, some P are not R. 1 1 1 1 0 1 0
2 1 1 0 1 0 1 2 1 1 0 1 1 1
(Vx)(Rx > Qx) 3 1 0 1 0 1 0 (Vx)(Rx > ~Qx) 3 1 0 1 1 0 0
(3x)(Px ^ ~Qx) 4 1 0 0 1 1 1 (3x)(Qx ^ Px) 4 1 0 0 1 0 1
(3x)(Px ^ ~Rx) 5 0 1 1 1 0 0 (3x)(Px ^ ~Rx) 5 0 1 1 0 0 0
6 0 1 0 1 0 0 6 0 1 0 1 0 0
7 0 0 1 0 0 0 7 0 0 1 1 0 0
8 0 0 0 1 0 0 8 0 0 0 1 0 0
II-EIO (fEstInO) I-AAI (bArbArI)
All R are not Q. ∃ ∃ ∃ ∀ ∃ ∃ All Q are R. ∃ ∃ ∃ ∀ ∀ ∃
Some P are Q. P Q R R => ~Q P^Q P ^ ~R All P are Q. P Q R Q => R P => Q P^R
8 Therefore, some P are not R. 1 1 1 1 0 1 0 20 Therefore, some P are R. 1 1 1 1 1 1 1
2 1 1 0 1 1 1 2 1 1 0 0 1 0
(Vx)(Rx > ~Qx) 3 1 0 1 1 0 0 (Vx)(Qx > Rx) 3 1 0 1 1 0 1
(3x)(Px ^ Qx) 4 1 0 0 1 0 1 (Vx)(Px > Qx) 4 1 0 0 1 0 0
(3x)(Px ^ ~Rx) 5 0 1 1 0 0 0 (3x)(Px ^ Rx) 5 0 1 1 1 1 0
6 0 1 0 1 0 0 6 0 1 0 0 1 0
7 0 0 1 1 0 0 7 0 0 1 1 1 0
8 0 0 0 1 0 0 8 0 0 0 1 1 0
III-AAI (dArAPtI) I-EAO (cElArOnt)
All Q are R. ∃ ∃ ∃ ∀ ∀ ∃ All Q are not R. ∃ ∃ ∃ ∀ ∀ ∃
All Q are P. P Q R Q => R Q => P P^R All P are Q. P Q R Q => ~R P => Q P ^ ~R
9 Therefore, some P are R. 1 1 1 1 1 1 1 21 Therefore, some P are not R. 1 1 1 1 0 1 0
2 1 1 0 0 1 0 2 1 1 0 1 1 1
(Vx)(Qx > Rx) 3 1 0 1 1 1 1 (Vx)(Qx > ~Rx) 3 1 0 1 1 0 0
(Vx)(Qx > Px) 4 1 0 0 1 1 0 (Vx)(Px > Qx) 4 1 0 0 1 0 1
(3x)(Px ^ Rx) 5 0 1 1 1 0 0 (3x)(Px ^ ~Rx) 5 0 1 1 0 1 0
6 0 1 0 0 0 0 6 0 1 0 1 1 0
7 0 0 1 1 1 0 7 0 0 1 1 1 0
8 0 0 0 1 1 0 8 0 0 0 1 1 0
III-AII (dAtIsI) II-EAO (cEsArO)
All Q are R. ∃ ∃ ∃ ∀ ∃ ∃ All R are not Q. ∃ ∃ ∃ ∀ ∀ ∃
Some Q are P. P Q R Q => R Q^P P^R All P are Q. P Q R R => ~Q P => Q P ^ ~R
10 Therefore, some P are R. 1 1 1 1 1 1 1 22 Therefore, some P are not R. 1 1 1 1 0 1 0
2 1 1 0 0 1 0 2 1 1 0 1 1 1
(Vx)(Qx > Rx) 3 1 0 1 1 0 1 (Vx)(Rx > ~Qx) 3 1 0 1 1 0 0
(3x)(Qx ^ Px) 4 1 0 0 1 0 0 (Vx)(Px > Qx) 4 1 0 0 1 0 1
(3x)(Px ^ Rx) 5 0 1 1 1 0 0 (3x)(Px ^ ~Rx) 5 0 1 1 0 1 0
6 0 1 0 0 0 0 6 0 1 0 1 1 0
7 0 0 1 1 0 0 7 0 0 1 1 1 0
8 0 0 0 1 0 0 8 0 0 0 1 1 0
III-IAI (dIsAmIs) II-AEO (cAmEstrOs)
Some Q are R. ∃ ∃ ∃ ∃ ∀ ∃ All R are Q. ∃ ∃ ∃ ∀ ∀ ∃
All Q are P. P Q R Q^R Q => P P^R All P are not Q. P Q R R => Q P => ~Q P ^ ~R
11 Therefore, some P are R. 1 1 1 1 1 1 1 23 Therefore, some P are not R. 1 1 1 1 1 0 0
2 1 1 0 0 1 0 2 1 1 0 1 0 1
(3x)(Qx ^ Rx) 3 1 0 1 0 1 1 (Vx)(Rx > Qx) 3 1 0 1 0 1 0
(Vx)(Qx > Px) 4 1 0 0 0 1 0 (Vx)(Px > ~Qx) 4 1 0 0 1 1 1
(3x)(Px ^ Rx) 5 0 1 1 1 0 0 (3x)(Px ^ ~Rx) 5 0 1 1 1 1 0
6 0 1 0 0 0 0 6 0 1 0 1 1 0
7 0 0 1 0 1 0 7 0 0 1 0 1 0
8 0 0 0 0 1 0 8 0 0 0 1 1 0
III-EAO (fElAptOn) IV-AEO (cAmEnOs)
All Q are not R. ∃ ∃ ∃ ∀ ∀ ∃ All R are Q. ∃ ∃ ∃ ∀ ∀ ∃
All Q are P. P Q R Q => ~R Q => P P ^ ~R All Q are not P. P Q R R => Q Q => ~P P ^ ~R
12 Therefore, some P are not R. 1 1 1 1 0 1 0 24 Therefore, some P are not R. 1 1 1 1 1 0 0
2 1 1 0 1 1 1 2 1 1 0 1 0 1
(Vx)(Qx > ~Rx) 3 1 0 1 1 1 0 (Vx)(Rx > Qx) 3 1 0 1 0 1 0
(Vx)(Qx > Px) 4 1 0 0 1 1 1 (Vx)(Qx > ~Px) 4 1 0 0 1 1 1
(3x)(Px ^ ~Rx) 5 0 1 1 0 0 0 (3x)(Px ^ ~Rx) 5 0 1 1 1 1 0
6 0 1 0 1 0 0 6 0 1 0 1 1 0
7 0 0 1 1 1 0 7 0 0 1 0 1 0
8 0 0 0 1 1 0 8 0 0 0 1 1 0
I-AAA (bArbArA) III-OAO (bOcArdO)
All Q are R. 3 3 3 V V V Some Q are not R. 3 3 3 3 V 3
All P are Q. P Q R Q>R P>Q P>R All Q are P. P Q R Q ^ ~R Q>P P ^ ~R
1 Therefore, all P are R. 1 1 1 1 1 1 1 13 Therefore, some P are not R. 1 1 1 1 0 1 0
2 1 1 0 0 1 0 2 1 1 0 1 1 1
(Vx)(Qx > Rx) 3 1 0 1 1 0 1 (3x)(Qx ^ ~Rx) 3 1 0 1 0 1 0
(Vx)(Px > Qx) 4 1 0 0 1 0 0 (Vx)(Qx > Px) 4 1 0 0 0 1 1
(Vx)(Px > Rx) 5 0 1 1 1 1 1 (3x)(Px ^ ~Rx) 5 0 1 1 0 0 0
6 0 1 0 0 1 1 6 0 1 0 1 0 0
7 0 0 1 1 1 1 7 0 0 1 0 1 0
8 0 0 0 1 1 1 8 0 0 0 0 1 0
I-EAE (cElArEnt) III-EIO (fErIsOn)
All Q are not R. 3 3 3 V V V All Q are not R. 3 3 3 V 3 3
All P are Q. P Q R Q > ~R P>Q P > ~R Some Q are P. P Q R Q > ~R Q^P P ^ ~R
2 Therefore, all P are not R. 1 1 1 1 0 1 0 14 Therefore, some P are not R. 1 1 1 1 0 1 0
2 1 1 0 1 1 1 2 1 1 0 1 1 1
(Vx)(Qx > ~Rx) 3 1 0 1 1 0 0 (Vx)(Qx > ~Rx) 3 1 0 1 1 0 0
(Vx)(Px > Qx) 4 1 0 0 1 0 1 (3x)(Qx ^ Px) 4 1 0 0 1 0 1
(Vx)(Px > ~Rx) 5 0 1 1 0 1 1 (3x)(Px ^ ~Rx) 5 0 1 1 0 0 0
6 0 1 0 1 1 1 6 0 1 0 1 0 0
7 0 0 1 1 1 1 7 0 0 1 1 0 0
8 0 0 0 1 1 1 8 0 0 0 1 0 0
I-AII (dArII) IV-AAI (brAmAntIp)
All Q are R. 3 3 3 V 3 3 All R are Q. 3 3 3 V V 3
Some P are Q. P Q R Q>R P^Q P^R All Q are P. P Q R R>Q Q>P P^R
3 Therefore, some P are R. 1 1 1 1 1 1 1 15 Therefore, some P are R. 1 1 1 1 1 1 1
2 1 1 0 0 1 0 2 1 1 0 1 1 0
(Vx)(Qx > Rx) 3 1 0 1 1 0 1 (Vx)(Rx > Qx) 3 1 0 1 0 1 1
(3x)(Px ^ Qx) 4 1 0 0 1 0 0 (Vx)(Qx > Px) 4 1 0 0 1 1 0
(3x)(Px ^ Rx) 5 0 1 1 1 0 0 (3x)(Px ^ Rx) 5 0 1 1 1 0 0
6 0 1 0 0 0 0 6 0 1 0 1 0 0
7 0 0 1 1 0 0 7 0 0 1 0 1 0
8 0 0 0 1 0 0 8 0 0 0 1 1 0
I-EIO (fErIO)
All Q are not R. 3 3 3 V 3 3 IV-IAI (dImArIs) 3 3 3 3 V 3
Some P are Q. P Q R Q > ~R P^Q P ^ ~R Some R are Q. P Q R R^Q Q>P P^R
4 Therefore, some P are not R. 1 1 1 1 0 1 0 16 All Q are P. 1 1 1 1 1 1 1
2 1 1 0 1 1 1 Therefore, some P are R. 2 1 1 0 0 1 0
(Vx)(Qx > ~Rx) 3 1 0 1 1 0 0 3 1 0 1 0 1 1
(3x)(Px ^ Qx) 4 1 0 0 1 0 1 (3x)(Rx ^ Qx) 4 1 0 0 0 1 0
(3x)(Px ^ ~Rx) 5 0 1 1 0 0 0 (Vx)(Qx > Px) 5 0 1 1 1 0 0
6 0 1 0 1 0 0 (3x)(Px ^ Rx) 6 0 1 0 0 0 0
7 0 0 1 1 0 0 7 0 0 1 0 1 0
8 0 0 0 1 0 0 8 0 0 0 0 1 0
II-EAE (cEsArE) IV-AEE (cAmEnEs)
All R are not Q. 3 3 3 V V V All R are Q. 3 3 3 V V V
All P are Q. P Q R R > ~Q P>Q P > ~R All Q are not P. P Q R R>Q Q > ~P P > ~R
5 Therefore, all P are not R. 1 1 1 1 0 1 0 17 Therefore, all P are not R. 1 1 1 1 1 0 0
2 1 1 0 1 1 1 2 1 1 0 1 0 1
(Vx)(Rx > ~Qx) 3 1 0 1 1 0 0 (Vx)(Rx > Qx) 3 1 0 1 0 1 0
(Vx)(Px > Qx) 4 1 0 0 1 0 1 (Vx)(Qx > ~Px) 4 1 0 0 1 1 1
(Vx)(Px > ~Rx) 5 0 1 1 0 1 1 (Vx)(Px > ~Rx) 5 0 1 1 1 1 1
6 0 1 0 1 1 1 6 0 1 0 1 1 1
7 0 0 1 1 1 1 7 0 0 1 0 1 1
8 0 0 0 1 1 1 8 0 0 0 1 1 1
II-AEE (cAmEstrEs) IV-EAO (fEsApO)
All R are Q. 3 3 3 V V V All R are not Q. 3 3 3 V V 3
All P are not Q. P Q R R>Q P > ~Q P > ~R All Q are P. P Q R R > ~Q Q>P P ^ ~R
6 Therefore, all P are not R. 1 1 1 1 1 0 0 18 Therefore, some P are not R. 1 1 1 1 0 1 0
2 1 1 0 1 0 1 2 1 1 0 1 1 1
(Vx)(Rx > Qx) 3 1 0 1 0 1 0 (Vx)(Rx > ~Qx) 3 1 0 1 1 1 0
(Vx)(Px > ~Qx) 4 1 0 0 1 1 1 (Vx)(Qx > Px) 4 1 0 0 1 1 1
(Vx)(Px > ~Rx) 5 0 1 1 1 1 1 (3x)(Px ^ ~Rx) 5 0 1 1 0 0 0
6 0 1 0 1 1 1 6 0 1 0 1 0 0
7 0 0 1 0 1 1 7 0 0 1 1 1 0
8 0 0 0 1 1 1 8 0 0 0 1 1 0
II-AOO (bArOcO) IV-EIO (frEsIsOn)
All R are Q. 3 3 3 V 3 3 All R are not Q. 3 3 3 V 3 3
Some P are not Q. P Q R R>Q P ^ ~Q P ^ ~R Some Q are P. P Q R R > ~Q Q^P P ^ ~R
7 Therefore, some P are not R. 1 1 1 1 1 0 0 19 Therefore, some P are not R. 1 1 1 1 0 1 0
2 1 1 0 1 0 1 2 1 1 0 1 1 1
(Vx)(Rx > Qx) 3 1 0 1 0 1 0 (Vx)(Rx > ~Qx) 3 1 0 1 1 0 0
(3x)(Px ^ ~Qx) 4 1 0 0 1 1 1 (3x)(Qx ^ Px) 4 1 0 0 1 0 1
(3x)(Px ^ ~Rx) 5 0 1 1 1 0 0 (3x)(Px ^ ~Rx) 5 0 1 1 0 0 0
6 0 1 0 1 0 0 6 0 1 0 1 0 0
7 0 0 1 0 0 0 7 0 0 1 1 0 0
8 0 0 0 1 0 0 8 0 0 0 1 0 0
II-EIO (fEstInO) I-AAI (bArbArI)
All R are not Q. 3 3 3 V 3 3 All Q are R. 3 3 3 V V 3
Some P are Q. P Q R R > ~Q P^Q P ^ ~R All P are Q. P Q R Q>R P>Q P^R
8 Therefore, some P are not R. 1 1 1 1 0 1 0 20 Therefore, some P are R. 1 1 1 1 1 1 1
2 1 1 0 1 1 1 2 1 1 0 0 1 0
(Vx)(Rx > ~Qx) 3 1 0 1 1 0 0 (Vx)(Qx > Rx) 3 1 0 1 1 0 1
(3x)(Px ^ Qx) 4 1 0 0 1 0 1 (Vx)(Px > Qx) 4 1 0 0 1 0 0
(3x)(Px ^ ~Rx) 5 0 1 1 0 0 0 (3x)(Px ^ Rx) 5 0 1 1 1 1 0
6 0 1 0 1 0 0 6 0 1 0 0 1 0
7 0 0 1 1 0 0 7 0 0 1 1 1 0
8 0 0 0 1 0 0 8 0 0 0 1 1 0
III-AAI (dArAPtI) I-EAO (cElArOnt)
All Q are R. 3 3 3 V V 3 All Q are not R. 3 3 3 V V 3
All Q are P. P Q R Q>R Q>P P^R All P are Q. P Q R Q > ~R P>Q P ^ ~R
9 Therefore, some P are R. 1 1 1 1 1 1 1 21 Therefore, some P are not R. 1 1 1 1 0 1 0
2 1 1 0 0 1 0 2 1 1 0 1 1 1
(Vx)(Qx > Rx) 3 1 0 1 1 1 1 (Vx)(Qx > ~Rx) 3 1 0 1 1 0 0
(Vx)(Qx > Px) 4 1 0 0 1 1 0 (Vx)(Px > Qx) 4 1 0 0 1 0 1
(3x)(Px ^ Rx) 5 0 1 1 1 0 0 (3x)(Px ^ ~Rx) 5 0 1 1 0 1 0
6 0 1 0 0 0 0 6 0 1 0 1 1 0
7 0 0 1 1 1 0 7 0 0 1 1 1 0
8 0 0 0 1 1 0 8 0 0 0 1 1 0
III-AII (dAtIsI) II-EAO (cEsArO)
All Q are R. 3 3 3 V 3 3 All R are not Q. 3 3 3 V V 3
Some Q are P. P Q R Q>R Q^P P^R All P are Q. P Q R R => ~Q P => Q P ^ ~R
10 Therefore, some P are R. 1 1 1 1 1 1 1 22 Therefore, some P are not R. 1 1 1 1 0 1 0
2 1 1 0 0 1 0 2 1 1 0 1 1 1
(Vx)(Qx > Rx) 3 1 0 1 1 0 1 (Vx)(Rx > ~Qx) 3 1 0 1 1 0 0
(3x)(Qx ^ Px) 4 1 0 0 1 0 0 (Vx)(Px > Qx) 4 1 0 0 1 0 1
(3x)(Px ^ Rx) 5 0 1 1 1 0 0 (3x)(Px ^ ~Rx) 5 0 1 1 0 1 0
6 0 1 0 0 0 0 6 0 1 0 1 1 0
7 0 0 1 1 0 0 7 0 0 1 1 1 0
8 0 0 0 1 0 0 8 0 0 0 1 1 0
III-IAI (dIsAmIs) II-AEO (cAmEstrOs)
Some Q are R. 3 3 3 3 V 3 All R are Q. 3 3 3 V V 3
All Q are P. P Q R Q^R Q>P P^R All P are not Q. P Q R R => Q P => ~Q P ^ ~R
11 Therefore, some P are R. 1 1 1 1 1 1 1 23 Therefore, some P are not R. 1 1 1 1 1 0 0
2 1 1 0 0 1 0 2 1 1 0 1 0 1
(3x)(Qx ^ Rx) 3 1 0 1 0 1 1 (Vx)(Rx > Qx) 3 1 0 1 0 1 0
(Vx)(Qx > Px) 4 1 0 0 0 1 0 (Vx)(Px > ~Qx) 4 1 0 0 1 1 1
(3x)(Px ^ Rx) 5 0 1 1 1 0 0 (3x)(Px ^ ~Rx) 5 0 1 1 1 1 0
6 0 1 0 0 0 0 6 0 1 0 1 1 0
7 0 0 1 0 1 0 7 0 0 1 0 1 0
8 0 0 0 0 1 0 8 0 0 0 1 1 0
III-EAO (fElAptOn) IV-AEO (cAmEnOs)
All Q are not R. 3 3 3 V V 3 All R are Q. 3 3 3 V V 3
All Q are P. P Q R Q > ~R Q>P P ^ ~R All Q are not P. P Q R R>Q Q > ~P P ^ ~R
12 Therefore, some P are not R. 1 1 1 1 0 1 0 24 Therefore, some P are not R. 1 1 1 1 1 0 0
2 1 1 0 1 1 1 2 1 1 0 1 0 1
(Vx)(Qx > ~Rx) 3 1 0 1 1 1 0 (Vx)(Rx > Qx) 3 1 0 1 0 1 0
(Vx)(Qx > Px) 4 1 0 0 1 1 1 (Vx)(Qx > ~Px) 4 1 0 0 1 1 1
(3x)(Px ^ ~Rx) 5 0 1 1 0 0 0 (3x)(Px ^ ~Rx) 5 0 1 1 1 1 0
6 0 1 0 1 0 0 6 0 1 0 1 1 0
7 0 0 1 1 1 0 7 0 0 1 0 1 0
8 0 0 0 1 1 0 8 0 0 0 1 1 0
