📚 NerdSchool Study Materials

UGC NET Paper 1 - Logical Transformations

NerdSchool

UGC NET Paper 1 • Concept 6

Conversion, Obversion
& Contraposition

Unit 6 • Chapter 1

Logical Transformations Made Simple

Topic 6: Simplifying Complex Propositions

📖 Based on Ankit Sharma's Book
UGC NET Paper 1 Volume 5 - Logical Reasoning Unlocked

+91 9645160045
NerdSchool
NerdSchool
CONCEPT 6

Why Simplify Propositions?

Understanding Logical Transformations

In exams like UGC NET, logical reasoning questions often ask you to identify equivalence or similarity between categorical propositions. These questions can include tricky elements like "non" in the subject or predicate.

❌ The Problem:

  • Propositions with "non-" (e.g., "non-mammal") complicate direct comparisons
  • Direct visual matching becomes difficult
  • You need a systematic method to identify equivalence

✅ The Solution:

By applying transformation rules, you can convert these to their simpler equivalents. These transformations involve changing the quantity (universal/particular) and quality (affirmative/negative).

🎯 Three Powerful Methods

Obversion

Change Quality + Add/Remove Non

Conversion

Swap Subject & Predicate

Contraposition

Swap + Add Non to Both

💡 Master These: These three methods are your toolkit for solving complex logical equivalence problems. Each method works on different proposition types and serves a specific purpose!

NerdSchool

1. Obversion

Change Quality + Add/Remove Non

📖 Definition

Obversion changes the quality of the proposition (affirmative ↔ negative) and replaces the predicate with its complement (adding or removing "non-").

🎯 SHORTCUT: "Change Quality + Add/Remove Non in Predicate"

✅ Works for ALL Proposition Types

A - All S are P E - No S are P I - Some S are P O - Some S are not P

🔄 The Two-Step Process

1

Remove "Non" from the predicate

If the predicate contains "non-", simply remove it.
If the predicate doesn't contain "non-", add it.

2

Change the Quality

If it's Affirmative, make it Negative.
If it's Negative, make it Affirmative.

🔄 Quality Changes

AFFIRMATIVE → NEGATIVE

"All/Some are" becomes
"No/Some are not"

NEGATIVE → AFFIRMATIVE

"No/Some are not" becomes
"All/Some are"

NerdSchool

Obversion: Examples

Step-by-Step Applications

📝 Example 1:

Original Statement

"No cats are non-mammals"

STEP 1

Remove Non

No cats are mammals

STEP 2

Change Quality

All cats are mammals

✅ Result:

"No cats are non-mammals" is equivalent to
"All cats are mammals"

📝 Example 2:

Original Statement

"Some birds are not non-parrots"

STEP 1

Remove Non

Some birds are not parrots

STEP 2

Change Quality

Some birds are parrots

✅ Result:

"Some birds are not non-parrots" is equivalent to
"Some birds are parrots"

NerdSchool

Obversion: Exam Questions

Actual UGC NET Examples

Asked in Exam

"All cats are feline" is logically equivalent to the statement - "No cats are non-feline"

Analysis: Applying obversion in reverse (add non + change quality)

Asked in Exam

"All professors are non-materialists" is logically equivalent to the statement - "No professors are materialists"

Analysis: Remove "non" from predicate + change quality (All → No)

Asked in Exam

"Some animals are herbivores" and "Some animals are not non-herbivores" are logically equivalent.

Analysis: Working backwards with obversion (Some are = Some are not non-)

Asked in Exam

"All plants are non-animals" is logically equivalent to "No plants are animals"

Analysis: Classic obversion - remove non + change quality (All → No)

💡 Exam Strategy:

When you see "non-" in a proposition in the exam, immediately think OBVERSION. Apply the two steps to find the equivalent statement. This works every single time!

NerdSchool

2. Conversion

Subject-Predicate Interchange

📖 Definition

Conversion swaps the Subject (S) and Predicate (P) of the statement without changing its quality.

🎯 SHORTCUT: "S ↔ P Interchange"

⚠️ Validity Rules

✅ Valid for:

E - No S are P
I - Some S are P

Direct swap works perfectly!

⚠️ Special Cases:

A - All S are P

Requires Limitation
(Quantity change needed)

O - Some S are not P

Cannot be converted!

📐 The Three Conversion Rules

E Rule 1: E (No S are P) → E (No P are S)

Example: No dogs are cats → No cats are dogs

I Rule 2: I (Some S are P) → I (Some P are S)

Example: Some birds are parrots → Some parrots are birds

A Rule 3: A (All S are P) → I (Some P are S) (Conversion by Limitation)

Example: All humans are mammals → Some mammals are humans

⚠️ Notice: "All" changes to "Some" (Quantity limitation required)

NerdSchool

Conversion: Exam Questions

Actual UGC NET Examples

E → E Asked in Exam

"No animals are trees" and "No trees are animals" are logically equivalent.

Analysis: Simple E proposition conversion - swap subject and predicate directly

I → I Asked in Exam

"Some monkeys are felines" and "Some felines are monkeys" are logically equivalent.

Analysis: Simple I proposition conversion - swap subject and predicate directly

A → I Asked in Exam

"All cows are herbivores" and "Some herbivores are cows" are logically equivalent.

Analysis: A proposition conversion requires limitation - "All" becomes "Some" when converting

Asked in Exam

🎯 Complex Exam Question:

Statement A: "Some non-dogs are non-friendly animals"
Statement B: "Some dogs are friendly animals"
Statement C: "Some friendly animals are dogs"

📊 Analysis:

  • Statement B and C are equivalents via valid conversion (I → I)
  • Statement A contains "non" in the subject and is NOT a direct conversion
  • Statement A would require obversion first before comparing with B or C

✅ Key Takeaway: Always check for "non-" in statements. If present, consider obversion first!

NerdSchool

3. Contraposition

Swap Terms + Add Non to Both

📖 Definition

Contraposition involves swapping the Subject (S) and Predicate (P) AND replacing both with their complements (adding "non" to both).

🎯 SHORTCUT: "Swap Terms + Add Non to Both"

⚠️ Validity Rules

✅ Valid for:

A - All S are P
O - Some S are not P

These two types work perfectly!

❌ NOT Valid for:

E - No S are P
I - Some S are P

Cannot use contraposition!

🔄 The Contraposition Process

ORIGINAL

All S are P

STEP 1: SWAP

All P are S

STEP 2: ADD NON

All non-P are non-S

🔁 Reverse Contraposition (Simplification Rule)

💡 Key Insight: If you have a statement with "non" in both terms (e.g., "All non-P are non-S"), you can simplify it to the standard form.

📐 Two-Step Simplification:

1

Remove "Non" from BOTH Subject and Predicate

2

Swap the Subject and Predicate

NerdSchool

Contraposition: Examples

Step-by-Step Applications

A-Type

Example 1: Universal Affirmative

Original Statement (A)

"All cats are mammals"

STEP 1: SWAP

All mammals are cats

STEP 2: ADD NON

All non-mammals are non-cats

✅ Result:

"All cats are mammals" is equivalent to
"All non-mammals are non-cats"

A-Type (Reverse)

Example 2: Simplification

Complex Statement

"All non-liquids are non-beverages"

STEP 1: REMOVE NON

All liquids are beverages

STEP 2: SWAP S & P

All beverages are liquids

✅ Simplified to:

"All non-liquids are non-beverages" simplifies to
"All beverages are liquids"

O-Type

Example 3: Particular Negative

Original Statement (O)

"Some birds are not mammals"

STEP 1: SWAP

Some mammals are not birds

STEP 2: ADD NON

Some non-mammals are not non-birds

✅ Result:

"Some birds are not mammals" is equivalent to
"Some non-mammals are not non-birds"

NerdSchool

Contraposition: Exam Questions

Actual UGC NET Examples

A-Type Asked in Exam

"All Cats are Carnivores" and "All non-carnivores are non-cats" are logically equivalent.

Analysis: Perfect A-type contraposition (swap + add non to both)

A-Type (Reverse) Asked in Exam

"All non-liquids are non-beverages" is logically equivalent to the statement "All beverages are liquid"

Analysis: Reverse contraposition used for simplification (remove non + swap)

O-Type Asked in Exam

"Some birds are not mammals" and "Some non-mammals are not non-birds" are logically equivalent.

Analysis: O-type contraposition (swap + add non to both)

O-Type Asked in Exam

"Some beverages are not liquids" and "Some non-liquids are not non-beverages" are logically equivalent.

Analysis: Another O-type contraposition confirmation

O-Type Asked in Exam

"Some monkeys are not intelligent animals" and "Some non-intelligent animals are not non-monkeys" are logically equivalent.

Analysis: Classic O-type contraposition example

💡 Exam Strategy:

  • A-Type (All): Contraposition is valid - swap and add non to both
  • O-Type (Some...not): Contraposition is valid - swap and add non to both
  • E & I Types: Contraposition is NOT valid in standard logic
  • When you see "non-" in both subject and predicate, use reverse contraposition to simplify!
NerdSchool

Complete Transformation Summary

All Four Proposition Types

A-Type

Universal Affirmative: All S are P

🔄 Obversion: No S are non-P

Change quality + add non to predicate

🔄 Conversion: Some P are S ⚠️ (Limitation)

Swap S & P + change quantity (All → Some)

🔄 Contraposition: All non-P are non-S

Swap S & P + add non to both

Asked in Exam
"All cats are carnivorous", "All non-carnivorous are non-cats" and "No cats are non-carnivorous" are equivalent.

E-Type

Universal Negative: No S are P

🔄 Obversion: All S are non-P

Change quality + add non to predicate

🔄 Conversion: No P are S

Simply swap S & P

❌ Contraposition: Not valid

Cannot use contraposition on E-type

Asked in Exam
"No plants are animals", "No animals are plants", and "All plants are non-animals" are equivalent.

NerdSchool

Particular Propositions

I-Type

Particular Affirmative: Some S are P

🔄 Obversion: Some S are not non-P

Change quality + add non to predicate

🔄 Conversion: Some P are S

Simply swap S & P

❌ Contraposition: Not valid

Cannot use contraposition on I-type

O-Type

Particular Negative: Some S are not P

🔄 Obversion: Some S are non-P

Change quality + add non to predicate

❌ Conversion: Not valid

Cannot convert O-type propositions

🔄 Contraposition: Some non-P are not non-S

Swap S & P + add non to both

📊 Master Validity Table

Which Transformations Are Valid?

Type Obversion Conversion Contraposition
A ⚠️*
E
I
O

⚠️* = Requires limitation (quantity change)