axiomatization

logic

Written by

The Information Architects of Encyclopaedia Britannica

Last updated

June 18, 2026

Quick Summary

The axiomatic method is a procedure in logic where an entire system is built through logical deduction from basic propositions called axioms. These axioms are derived from a few undefined primitive terms. The goal is to create a formal system where all statements can be proven from these foundational assumptions.

Historically, Euclid's geometry and Aristotle's syllogistic logic are early examples of axiomatized systems. In the 20th century, mathematicians like Bertrand Russell and Alfred North Whitehead attempted to formalize all of mathematics using this method. The axiomatic approach has also been applied to empirical sciences like biology and psychology. Axiomatic set theory, for instance, uses axioms to define properties of sets and the membership relation, aiming for consistency and richness in its theorems.12

Summary created from Britannica articles using AI. AI can make mistakes, so verify using Britannica articles.

3 Britannica Sources

Ask Britannica AI about this topic

Britannica doesn't have a full article on this topic, so we've curated a list of our relevant coverage.

history of logic
Gödel’s incompleteness theorems
…prove the consistency of an axiomatized elementary arithmetic within the system itself, one would also be able to prove G within it. The conclusion that follows, that the consistency of arithmetic cannot be proved within arithmetic, is known as Gödel’s second incompleteness theorem. This result showed that Hilbert’s project of…
Read More
…prove the consistency of an axiomatized elementary arithmetic within the system itself, one would also be able to prove G within it. The conclusion that follows, that the consistency of arithmetic cannot be proved within arithmetic, is known as Gödel’s second incompleteness theorem. This result showed that Hilbert’s project of…
Read More

formal logic
Axiomatization of LPC
Rules of uniform substitution for predicate calculi, though formulable, are mostly very complicated, and, to avoid the necessity for these rules, axioms for these systems are therefore usually given by axiom schemata in the sense explained earlier (see above Axiomatization of PC)
Read More
Rules of uniform substitution for predicate calculi, though formulable, are mostly very complicated, and, to avoid the necessity for these rules, axioms for these systems are therefore usually given by axiom schemata in the sense explained earlier (see above Axiomatization of PC)
Read More

formal logic
Axiomatization of PC
The basic idea of constructing an axiomatic system is that of choosing certain wffs (known as axioms) as starting points and giving rules for deriving further wffs (known as theorems) from them. Such rules are called transformation rules. Sometimes
Read More
The basic idea of constructing an axiomatic system is that of choosing certain wffs (known as axioms) as starting points and giving rules for deriving further wffs (known as theorems) from them. Such rules are called transformation rules. Sometimes
Read More

formal logic
Partial systems of PC
The task of axiomatizing PIC is that of finding a set of valid wffs, preferably few in number and relatively simple in structure, from which all other valid wffs of the system can be derived by straightforward transformation rules. The best-known basis, which was formulated in 1930, has…
Read More
The task of axiomatizing PIC is that of finding a set of valid wffs, preferably few in number and relatively simple in structure, from which all other valid wffs of the system can be derived by straightforward transformation rules. The best-known basis, which was formulated in 1930, has…
Read More