← CSC 113 Discrete Mathematics
Propositional Logic and Logical Connectives
Notes
INTRODUCTION TO PROPOSITIONAL LOGIC
Propositional logic serves as the mathematical foundation for computer science, hardware architecture, and software verification. In discrete mathematics, a proposition is defined as a declarative statement that is either strictly true or strictly false, but never both simultaneously. For instance, Nairobi is the capital of Kenya is a valid proposition with a truth value of True, whereas What time is it? is not a proposition because it lacks a definitive truth value.
BASIC LOGICAL OPERATORS
Compound propositions are constructed by combining atomic propositions using logical connectives. The fundamental connectives include negation, conjunction, disjunction, exclusive disjunction, implication, and biconditional.
Negation, denoted by not, inverts the truth value of a proposition.
Conjunction, represented as and, evaluates to true only when both constituent propositions are true.
Disjunction, represented as or, is an inclusive operation that evaluates to true if at least one proposition is true.
Implication, stated as if P then Q, is false only when the antecedent P is true while the consequent Q is false; in all other scenarios, it evaluates to true. Understanding truth tables enables software engineers to model conditional statements and algorithm branching precisely.
PRACTICAL EXAMPLE
Consider the Hustler Fund or an M-Pesa automated micro-lending engine developed for Kenyan fintech platforms. A customer qualifies for an automated loan disbursement if three conditions are satisfied:
Condition P: The customer possesses a verified Kenyan National ID.
Condition Q: The customer has maintained an active SIM card for at least six months.
Condition R: The customer is currently blacklisted by the Credit Reference Bureau (CRB).
The business logic dictates that loan approval requires P and Q to both be true, combined with the negation of R. Formally, the approval proposition is expressed as: Approval = P and Q and (not R).
Suppose John applies for a loan with the following parameter values:
John has a verified Kenyan National ID, so P is True.
John registered his Safaricom SIM card three months ago, so Q is False.
John has no outstanding defaults with CRB, so R is False, which means not R is True.
Evaluating the proposition:
Approval = True and False and (not False)
Approval = True and False and True
Approval = False
Because condition Q failed, the automated lending engine denies the loan request without requiring manual human review.
Quiz
1. If proposition A is True and proposition B is False, what is the truth value of (not A) or B?
2. Under which specific condition does the logical implication P implies Q evaluate to False?
3. Which of the following sentences represents a valid proposition in discrete mathematics?
Sign in to submit and securely grade your quiz.