Propositional Logic is a formal knowledge representation method in which basic statements, called propositions, are assigned truth values. In classical propositional logic, each proposition is either true or false. Propositions are commonly represented using symbols such as P, Q, and R. Logical connectives combine these propositions into compound expressions. Negation (NOT) reverses a proposition's truth value. Conjunction (AND) is true only when both connected propositions are true. Disjunction (OR) is true when at least one connected proposition is true. Implication (IF–THEN) is false only when its antecedent is true and its consequent is false. Biconditional expresses that two propositions have the same truth value. Truth tables can be used to evaluate compound expressions systematically. Important logical concepts include tautologies, contradictions, and logical equivalence. Propositional logic is useful for representing simple facts and rules, but it cannot directly express variables, objects, or relationships involving quantifiers. First-order predicate logic provides greater expressive power for those situations.
Propositional Logic
Propositional logic is a formal system that represents statements as propositions that can be either true or false and combines them using logical connectives.
P ∧ Q; P ∨ Q; ¬P; P → Q; P ↔ Q
Explanation
Variables
| Symbol | Meaning |
|---|---|
P, Q | Symbols representing individual propositions. |
¬ | Negation; reverses the truth value of a proposition. |
∧ | Conjunction; true when both propositions are true. |
∨ | Disjunction; true when at least one proposition is true. |
→ | Implication; represents an IF–THEN relationship. |
↔ | Biconditional; true when both propositions have the same truth value. |
Example or application
Let P mean 'It is raining' and Q mean 'The road is wet'. The expression P → Q represents 'If it is raining, then the road is wet'. If P is true and Q is false, the implication is false.
Text
Propositional logic allows AI systems to express and evaluate simple facts. Logical operators such as AND, OR, NOT, and implication connect propositions to form more complex statements.
Key Points
A proposition is a declarative statement with a truth value.
Classical propositional logic uses true and false truth values.
Logical connectives combine simple propositions into compound expressions.
Truth tables show the truth values of logical expressions.
Propositional logic cannot directly express quantified relationships between individual objects.
Applications
Digital circuit design
Rule-based reasoning
Formal verification
Automated theorem proving
Constraint-solving systems
Learning Outcomes
Identify propositions and their truth values.
Use basic logical connectives.
Construct truth tables for compound expressions.
Distinguish tautologies, contradictions, and logical equivalences.
Practice Questions
What is a proposition?
When is a conjunction P AND Q true?
When is an implication P → Q false?
What is the limitation of propositional logic?
Related Concepts
First-Order Predicate Logic
Logical Inference and Deduction
Truth Tables
Boolean Algebra
Common Mistakes
Treating a question or command as a proposition without a defined truth value.
Assuming implication means that the first event necessarily causes the second.
Confusing logical OR with exclusive OR.
Forgetting that an implication with a false antecedent is true in classical logic.
Sources and verification
Sources are shown as provided in the project data. Not every source has yet been independently verified. Please report errors or missing citations.
- Russell, S. and Norvig, P. Artificial Intelligence: A Modern Approach, logical agents.
- Huth, M. and Ryan, M. Logic in Computer Science: Modelling and Reasoning about Systems.
Suggest a correction or source · More in Artificial Intelligence & Machine Learning