Description

Propositional Logic (also known as Boolean logic) is a branch of logic that deals with propositions — statements that are either true or false, but not both. It forms the basis of reasoning in Artificial Intelligence, computer science, and digital circuit design. It uses logical connectives like:

Examples (Code)

Below is a simple example

#Example 1: Evaluating Basic Propositions
# Defining propositions as Boolean variables
P = True
Q = False

# Logical operations
print("NOT P:", not P)           # False
print("P AND Q:", P and Q)       # False
print("P OR Q:", P or Q)         # True
print("P => Q:", not P or Q)     # False (Implication)
print("P <=> Q:", P == Q)        # False (Equivalence)

#Example 2: Constructing a Truth Table
from itertools import product

print("P\tQ\t¬P\tP∧Q\tP∨Q\tP→Q\tP↔Q")
for P, Q in product([True, False], repeat=2):
    not_P = not P
    and_PQ = P and Q
    or_PQ = P or Q
    implies = not P or Q
    equiv = P == Q
    print(f"{P}\t{Q}\t{not_P}\t{and_PQ}\t{or_PQ}\t{implies}\t{equiv}")

 

Where topic Is Applied

Resources