Notes

Proposition in Discrete Mathematics [ English ]

< Prev Next >

1. Introduction to Proposition

In discrete mathematics, logic forms the backbone of reasoning and problem-solving. The most basic unit of logic is a proposition. All logical operations—such as conjunction, disjunction, negation, and implication—are built upon propositions.

Understanding propositions is essential before studying more advanced logical concepts.

2. Definition of Proposition

A proposition is a declarative statement that has a definite truth value, either True or False, but not both.

Key Characteristics:

3. Examples of Propositions

Valid Propositions

✔ Each of these statements is either true or false.

Not Propositions

✔ These do not have definite truth values.

4. Propositional Variables

Propositions are often represented using symbols such as:

p, q, r, ...

Each variable represents a proposition with a truth value:

5. Types of Propositions

(a) Simple (Atomic) Proposition

A simple proposition cannot be broken down into smaller parts.

Example:

(b) Compound Proposition

A compound proposition is formed by combining simple propositions using logical operators.

Examples:

p ∧ q
p ∨ q
¬p
p → q
p ↔ q

6. Logical Operators Used with Propositions

Operator Symbol Meaning
Negation ¬ NOT
Conjunction AND
Disjunction OR
Conditional IF...THEN
Biconditional IF AND ONLY IF

7. Open Sentences vs Propositions

An important distinction:

Open Sentence (Predicate)

Proposition

8. Truth Value of a Proposition

Every proposition has exactly one truth value:

There is no ambiguity.

9. Importance of Propositions

(a) Foundation of Logic

All logical expressions are built using propositions.

(b) Computer Science

(c) Mathematics

10. Key Observations

11. Summary

< Prev Next >