Nepedia
Back to Discover
Advanced Reader
🔢

Propositional logic

math Maturity 13-18 Next article →

Propositional logic is a fundamental branch of classical logic. It is also known by several other names, such as statement logic, sentential calculus, or propositional calculus. Some scholars refer to it as zeroth-order logic. This field studies propositions and the relationships between them. A proposition is a declarative sentence that carries a truth value. This means the statement must be either true or false.

LK groupe logique
LK groupe logique

For example, saying "London is the capital of England" is a proposition because it is true. However, asking "What is Wikipedia?" is not a proposition. Questions and commands, known as imperative statements, do not have truth values. Therefore, they fall outside the scope of standard propositional logic.

At its core, the mechanism of this logic involves combining simple statements into complex ones. Simple statements are called atomic formulas or atomic sentences. We build compound sentences, also called molecular sentences, by using logical connectives. These connectives act as truth-functors that determine the truth of the new sentence. The primary types of connectives include negation, conjunction, disjunction, implication, and biconditional. In English, these correspond to "not," "and," "or," "if," and "if and only if."

Partially built tableau
Partially built tableau

When we use these tools, we create a formal language. In this language, we represent propositions with letters called propositional variables. This allows mathematicians to study the structure of an argument without getting distracted by the specific meaning of the words.

There are several distinct ways to categorize the components of this system. First, we distinguish between atomic and compound propositions. Atomic propositions are the indivisible building blocks of the logic. Compound propositions are formed when connectives join these blocks together. Second, we distinguish between different types of logical consequences. We use the term semantic consequence to describe when a conclusion follows from premises based on truth values. We use syntactic consequence to describe when a conclusion is derived through formal rules of a system.

LK groupe logique
LK groupe logique

This distinction is vital for understanding how formal proofs actually function.

The history of propositional logic spans thousands of years. While earlier philosophers hinted at these ideas, Chrysippus is often credited with developing a formal deductive system in the 3rd century BC. His work was expanded by the Stoics, but most of their writings were lost. Between the 3rd and 6th century CE, this logic faded into oblivion. It was eventually resurrected in the 20th century. During the 17th and 18th centuries, Gottfried Leibniz developed symbolic logic through his calculus ratiocinator. Although his work was not widely known then, later logicians like George Boole and Augustus De Morgan independently recreated many of his advances.

Significant mathematical tools have emerged to help us analyze these logical structures. Truth tables are a common method used to evaluate the truth of compound sentences. While the exact inventor is uncertain, the tabular structure is often credited to Ludwig Wittgenstein or Emil Post. Other thinkers like Bertrand Russell and Gottlob Frege provided ideas that led to their use. Other specialized tools include truth trees, invented by Evert Willem Beth, and natural deduction, developed by Gerhard Gentzen and Stanisław Jaśkowski.

Partially built tableau
Partially built tableau

Each of these methods provides a different way to verify if a logical statement holds up under scrutiny.

We can use propositional logic to evaluate the strength of arguments. An argument consists of a set of premises and a conclusion. The premises are intended to support the conclusion. We call an argument valid if it is impossible for the premises to be true while the conclusion is false. In a valid argument, the conclusion is a necessary logical consequence of the premises. However, validity is not the same as soundness. An argument is only sound if it is valid and all of its premises are actually true in reality. This distinction helps us separate the structure of an idea from the facts of the world.

Propositional logic serves as a vital foundation for more complex mathematical systems. It is included in the machinery of first-order logic and higher-order logics. While propositional logic does not deal with non-logical objects or quantifiers, it provides the basic rules that those higher systems rely on. Gottlob Frege's predicate logic, for instance, builds directly upon these principles. By combining the features of syllogistic logic and propositional logic, Frege ushered in a new era of logical study. Today, the study of these connections remains essential for mathematics, computer science, and philosophy.

726 words

Where will your curiosity go next?

Keep exploring at your chosen reading level.

🖼️ Images & Media (2)
File:Partially built tableau.svg
Partially built tableau.svg
File:LK groupe logique.png
LK groupe logique.png
More to explore

🔬 Go deeper

More advanced topics to explore

🪜 Step back

Simpler topics to build understanding

What is Nepedia?

A free, ad-free encyclopedia for children. Every article is written at five reading levels, so the same page works for a five-year-old and a fifteen-year-old — use the level switcher above to see this one change. No account needed to read.