Categories
October Surprise 2024

Formal logic – Propositional Calculus, Symbolic Notation …

Given any two propositions p and q, then p ∨ q (ā€œ p or q ā€) is to count as false when p and q are both false and true in all other cases; thus it represents the assertion that at least one of p and q is true. P ∨ q is known as the disjunction of p and q; ā€œāˆØā€ is the disjunction sign, and its arguments (p, q) are known as disjuncts.