Propositional Logic: Proposition

Definition

A proposition is a declarative statement that is definitely true or false, but not both.

In symbolic form, propositions are often represented by letters such as $p$ , $q$ , and $r$ . Each proposition has exactly one truth value at a given time or in a given logical interpretation.

Examples:

“2 + 3 = 5” is a proposition and is true.
“7 is an even number” is a proposition and is false.
“x > 5” is not a proposition by itself because its truth value depends on the value of $x$ .

The key idea is that a proposition must be:

1. Declarative

— it states something.

2. Unambiguous

— its truth can be determined.

3. Binary in truth value

— it is either true or false.

Main Content

1. First Concept: Types of Propositions

Simple Proposition

A simple proposition is a single statement that cannot be broken into smaller logical statements using logical connectives.
Example: “Ravi is a student.”
If this statement is true, its truth value is simply true; if false, it is false.
Simple propositions are the atoms of propositional logic because more complex formulas are built from them.

Compound Proposition

A compound proposition is formed by combining two or more simple propositions using logical connectives such as and, or, not, if...then, and if and only if.
Example:
- $p$ : “It is raining.”
- $q$ : “The ground is wet.”
- Compound statement: “It is raining and the ground is wet.”
Compound propositions are central in logic because they allow us to model real situations involving multiple conditions.
Their truth values depend on the truth values of the component propositions.

A useful structure for understanding this is:

Simple propositions  -->  Logical connectives  -->  Compound proposition
     p, q, r                   AND, OR, NOT              p ∧ q, p ∨ q, ¬p

Propositions can also be classified based on truth behavior:

Tautology

: always true, such as $p \lor \neg p$

Contradiction

: always false, such as $p \land \neg p$

Contingency

: sometimes true and sometimes false, depending on the values of its variables

These classifications are extremely important in reasoning and proofs.

2. Second Concept: Truth Values and Logical Symbols

Truth Values

Every proposition has a truth value: True (T) or False (F).
In formal logic, truth values are used to evaluate logical expressions systematically.
Truth values are not subjective; they are determined by meaning, facts, or interpretation.
Example:
- Proposition $p$ : “10 is greater than 5” → True
- Proposition $q$ : “A square has 5 sides” → False

Logical Symbols and Notation

Propositions are often written using symbols to make logical reasoning precise and concise.
Common symbols include:
- $p, q, r$ : proposition variables
- $\neg p$ : NOT $p$
- $p \land q$ : $p$ AND $q$
- $p \lor q$ : $p$ OR $q$
- $p \rightarrow q$ : if $p$ , then $q$
- $p \leftrightarrow q$ : $p$ if and only if $q$

Truth Tables

A truth table is a systematic way to show the truth value of a proposition for all possible combinations of truth values of its components.
For example, the conjunction $p \land q$ is true only when both $p$ and $q$ are true.

Example truth table:

p	q	p ∧ q
T	T	T
T	F	F
F	T	F
F	F	F

Truth tables help determine whether a proposition is a tautology, contradiction, or contingency. They are also used to verify logical equivalence and to simplify logical expressions in computing.

3. Third Concept: Well-Formed Statements and Proposition Use in Logic

Well-Formed Propositions

In propositional logic, a statement must be grammatically and logically well-formed to be treated as a proposition.
A well-formed proposition avoids ambiguity and has a clear truth value.
Example:
- “The number 8 is even” is well-formed and clearly true.
- “That is good” is ambiguous unless context makes it specific.
A vague statement cannot reliably serve as a proposition in formal logic.

Propositions in Reasoning and Problem Solving

Propositions are used to build arguments, prove theorems, and analyze conditions.
Example of logical reasoning:
- $p$ : “It is sunny.”
- $q$ : “We will go outside.”
- Statement: “If it is sunny, then we will go outside.”
Such expressions help in decision-making processes, especially in computer programs and finite state machines where transitions depend on conditions.

Propositions in Computing and FSM Context

In computer science, propositions represent conditions in algorithms, Boolean expressions in programming, and transition conditions in finite state machines.
Example:
- If a machine is in state $S_0$ and the input condition $p$ is true, it moves to state $S_1$ .
Propositions are the language through which systems make yes/no decisions.

A simple decision model:

[Condition p?] --Yes--> [State A]
      |
      No
      v
   [State B]

This illustrates how propositions can control behavior based on whether a condition is true or false.

Working / Process

1. Identify the statement

Determine whether the sentence is declarative and whether it claims something that can be judged true or false.
If it is a question, command, or vague expression, it is not a proposition.
Example:
- “The Earth orbits the Sun” → proposition
- “Open the window” → not a proposition

2. Assign or determine the truth value

Check whether the statement is true or false based on facts, definitions, or context.
If the proposition is simple, its truth value is direct.
If it is compound, evaluate the component propositions first.

3. Represent and analyze logically

Convert the proposition into symbolic form using logical variables and connectives.
Use truth tables, logical equivalence, or other logical tools to examine its behavior.
Example:
- $p$ : “It is raining.”
- $q$ : “I will carry an umbrella.”
- Logical form: $p \rightarrow q$
Analyze whether the implication holds under different cases using a truth table.

Advantages / Applications

Precise reasoning

Propositions eliminate ambiguity and allow exact logical analysis.
This is essential in mathematics, philosophy, and computer science.

Foundation for digital systems and programming

Boolean conditions in programming languages and digital circuits are based on propositions.
If-else statements, while loops, and logical checks all depend on proposition-like conditions.

Support for finite state machines and automated decision-making

FSMs use logical input conditions to move from one state to another.
Propositions help define transition rules clearly and systematically.

Summary

A proposition is a statement with a definite truth value.
Propositions may be simple or compound.
Logical symbols and truth tables help analyze propositions formally.
Important terms to remember: proposition, truth value, simple proposition, compound proposition, tautology, contradiction, contingency, logical connectives, truth table, well-formed statement