Scribd
Upload
91 views5 pages

Higher Level Syllogisms

This document discusses methods for solving syllogism problems using Venn diagrams and rules. It provides two examples of syllogism cases with statements and possible Venn diagram representations. For each case, it analyzes several potential conclusions and determines whether they are true or false based on the initial statements and diagrams. The key methods discussed are using Venn diagrams to visually represent statement relationships and determine valid conclusions, and applying rules to conclude whether statements follow logically or not.

Uploaded by

Abhishekh Bhatnagar
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
91 views5 pages

Higher Level Syllogisms

This document discusses methods for solving syllogism problems using Venn diagrams and rules. It provides two examples of syllogism cases with statements and possible Venn diagram representations. For each case, it analyzes several potential conclusions and determines whether they are true or false based on the initial statements and diagrams. The key methods discussed are using Venn diagrams to visually represent statement relationships and determine valid conclusions, and applying rules to conclude whether statements follow logically or not.

Uploaded by

Abhishekh Bhatnagar
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

SYLLOGISM Methods to Solve: 1. Venn Diagram 2.

Rule Method Venn diagram: Statements with ALL are similar to EACH, EVERY, 100%, ATMOST. And these words can replace ALL without making any changes to the statement. o E.g.: All Fans are Tables----> 100% Fans are Tables. ALL type statements, is also applicable as SOME type statements, but not vice-versa. o E.g.: Statement: All Fans are Tables. Conclusion: Some Fans are Tables.(TRUE) Some Tables are Fans.(TRUE) All Tables are Fans.(FALSE) Statements: Some Fans are Tables. Conclusion: Some Tables are Fans.(TRUE) All Fans are Tables.(FALSE) All Tables are Fans.(FALSE) CASE 1: STATEMENT: (i)ALL RED ARE GREEN. (ii)NO RED IS FRUIT. There are 3 possible diagrams for the statements given.

Green Fruit

Green Red Fruit

Red

Green red Fruit

CONCLUSIONS: 1. No fruits are green. False, because no where it is mentioned that Fruits cant be Green. 2. No fruit being green is a possibility. True. 3. Some fruits are green. False, because it is also possible that no fruit be green. 4. Some fruits being green are a possibility. True. 5. All fruits being green are a possibility. True. 6. Some fruits are not green. True. 7. Some green are red. True. 8. All green are red. False, because if all red are green, then it is not necessary that all red are green. 9. All fruits are definitely not red. True. 10. All fruits are not definitely green. True, because here not definitely refers to possibly. So this statement can also be written as All fruits being green is a possibility. 11. All those green which are red, can never be fruits. True. 12. All fruits are definitely green. False, because some parts of green is red(acc. To statement 1) and no red is green.

CASE 2: STATEMENTS: (i) ALL Nepal is Russia. (ii) No Nepal is Pakistan. Few possible diagrams:

Russia

Russia Nepal Nepal

Russia Nepal

Pak

pak Pak

Conclusions: 1. Some Russia is not Pakistan. True, because there will be certain areas of Russia which Pakistan can never cover (i.e. which come under Nepal) 2. Some Nepal is not Pakistan. True. 3. All Russia being Pakistan is a possibility. False. 4. All Pakistan being Russia is a possibility. True.

CASE 3: STATEMENTS: (i) Some A are B. (ii) Some B are C. Few possible diagrams are:

A C

A C B

CONCLUSIONS: 1. No A is C. False 2. Some A are C. False NOTE: But above two conclusions are considered as either/or statements.

You might also like