A disjunction p OR q is true when at least one proposition is true.
What Is Disjunction?
A disjunction p OR q is true when at least one proposition is true.
Examples of Disjunction
1
True ∨ False = True.Formula and Key Points
Formula / rule
p ∨ q
- Know the definition and standard notation for Disjunction.
- Be able to recognise or compute disjunction in a small example.
- Connect the concept to nearby topics in the same subject before using it in larger CSE problems.
Why This Matters in Computer Science
Used in program conditions, digital circuits, database queries, formal verification, search and decision logic.
Related Math Terms
Disjunction: Frequently Asked Questions
What is Disjunction?
A disjunction p OR q is true when at least one proposition is true.
Why is Disjunction useful in computer science?
Used in program conditions, digital circuits, database queries, formal verification, search and decision logic.