Skip to content
LearnTronics menu

LearnTronics

From Symbolic Logic to Boolean Algebra

Tutorial Index

Where we are now

Several closely related terms are about to appear, so it helps to put them in order.

Symbolic logic — the broad umbrella

Symbolic logic is the broad study of representing logical relationships with symbols so their form can be examined precisely.

Propositional logic, also called propositional calculus, is one particular system within symbolic logic. It treats complete statements as units and studies how NOT, AND, OR, implication, and related connectives combine them.

Boolean algebra is an algebraic mathematical structure built around two-valued variables and operations such as NOT, AND, and OR. In digital electronics it gives us a practical way to calculate, rewrite, simplify, and minimize switching relationships.

words and statements → symbolic logic → propositional relationships → Boolean algebra → physical circuits

Mathematics gives us another set of tools

The meaning of the logic does not change when it becomes algebra. We gain rules for rearranging and simplifying expressions, much as grade-school algebra lets us rearrange ordinary equations.

But Boolean algebra has its own rules. For example, in Boolean OR:

1 + 1 = 1

because “true OR true” is still simply true.

And the real circuit still matters

A Boolean equation describes what the logic should do. A datasheet tells us whether a physical device can do it reliably, at the required speed, voltage, current, temperature, and load.

IDEAL LOGIC The equation says what the output should mean. REAL HARDWARE The datasheet says how well and how fast it does it. load #1load #2load #3 fan-out = how many loads may be driven reliably input A output Y tpd Real output changes a little later.

Fan-out and delay are two different limits

Fan-out asks: how many following logic inputs may this output drive reliably?

Propagation delay asks: after the input changes, how long before the output reaches the corresponding new logical state?

Datasheets often give propagation delays such as tPLH (output LOW-to-HIGH) and tPHL (output HIGH-to-LOW). They need not be exactly equal.

Other real-world specifications appear later

Rise time, fall time, input and output current, noise margin, supply voltage, power dissipation, capacitive loading, temperature, and the accumulated delay through several stages can all matter.

For now the important habit is simple: logical correctness and electrical correctness are both required.

Try these yourself

Which field is the broad umbrella that uses symbols to study logical form?
Symbolic logic is the broad umbrella. Propositional logic and Boolean algebra are more specific systems or structures used within that larger territory.
What does propagation delay describe? IDEAL LOGIC The equation says what the output should mean. REAL HARDWARE The datasheet says how well and how fast it does it. load #1load #2load #3 fan-out = how many loads may be driven reliably input A output Y tpd Real output changes a little later.
Propagation delay is the finite time a real logic device takes to respond after an input change.
Why can a logically correct digital circuit still fail in hardware?
The logic equation may be correct while the physical circuit violates a device specification.
< Equivalent Gates and De Morgan's Laws   |   Boolean Laws and Identities >