Codd's theorem¶

The database-theory result that relational algebra and domain-independent relational calculus have exactly the same expressive power.

Version: v2 · 2026-09-19 · History
Domain-specific #: 3719
Domain group: Applied Sciences & Engineering
Origin domain: Computer Science & Software Engineering
Subdomain: Database Theory → Computer Science & Software Engineering

Core Idea¶

The equivalence applies to safe or domain-independent calculus queries under the relational model, excluding formulas whose answer changes when the ambient value domain is enlarged. Each algebra operator is translated into a calculus formula, while safe calculus formulas are normalized and compiled into finite relational-algebra operations over active-domain data. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

How would you explain it like I'm…

Two Ways to Ask, Same Answer

There are two ways to ask a big box of lists a question. One way gives step-by-step instructions, like 'take this list, keep these rows, join it with that list'. The other way just describes what you want. Codd's theorem says both ways can ask exactly the same questions, as long as the description only talks about things actually in the box.

Recipe Equals Description

Databases often store information in tables. There are two classic ways to ask a database a question. One is a recipe of steps, like 'pick these rows, join these tables, keep these columns'; this is called relational algebra. The other is a description of the answer you want, written in logic; this is called relational calculus. Codd's theorem proves the two are equally powerful: any safe description can be turned into a recipe, and any recipe can be turned into a description, with the same answers. 'Safe' means the question only depends on the data actually in the tables, not on every possible value in the world.

Algebra-Calculus Query Equivalence

Codd's theorem states that relational algebra and relational calculus have the same expressive power for querying relational databases, as long as the calculus is restricted to safe (domain-independent) queries. Relational algebra is procedural: queries are built from operators like selection, projection, join, union, and difference. Relational calculus is declarative: a query is a logical formula describing which tuples belong in the answer. The theorem works in both directions: each algebra operator translates into a calculus formula, and each safe calculus formula can be turned into a finite sequence of algebra operations on the values actually present in the database. The safety restriction matters because some formulas, such as 'everything not in this table', would give answers that change if the set of possible values is enlarged, and algebra cannot express those.

Codd's theorem establishes that relational algebra and the safe (domain-independent) fragment of relational calculus, in tuple or domain form, are equivalent in expressive power over the relational model. The setting is a relational schema with a finite instance; queries have a fixed arity determined by their free variables. One direction translates each algebra operator into a calculus formula. The other normalizes a safe calculus formula and compiles it into a finite relational-algebra expression evaluated over the active domain, the values actually occurring in the instance. Domain independence is load-bearing: formulas whose answers change when the ambient value domain grows are excluded, since no algebra expression over finite relations can capture them. The equivalence is semantic: translated queries return the same answers on every instance. This result underpins declarative query languages, since it guarantees that a logical specification can be compiled into executable algebra.

Scope of Application¶

Codd's theorem belongs to database theory and is useful where the analyst can specify the typed database theory carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, then evaluate the relational schema and finite instance, relational-algebra operators, tuple or domain calculus syntax, free variables and query arity, domain-independence or safety condition, active-domain convention, both translation directions and semantic equality are explicit. The scope is broad within that domain but bounded by the need for the relational schema and finite instance, relational-algebra operators, tuple or domain calculus syntax, free variables and query arity, domain-independence or safety condition, active-domain convention, both translation directions and semantic equality are explicit.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the relational schema and finite instance, relational-algebra operators, tuple or domain calculus syntax, free variables and query arity, domain-independence or safety condition, active-domain convention, both translation directions and semantic equality are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Codd's theorem. Codd's theorem compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: the typed database theory carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express the relational schema and finite instance, relational-algebra operators, tuple or domain calculus syntax, free variables and query arity, domain-independence or safety condition, active-domain convention, both translation directions and semantic equality are explicit independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of database theory because they reuse the typed database theory carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, Each algebra operator is translated into a calculus formula, while safe calculus formulas are normalized and compiled into finite relational-algebra operations over active-domain data., and type the carrier, state every parameter and convention in the definition, test that the relational schema and finite instance, relational-algebra operators, tuple or domain calculus syntax, free variables and query arity, domain-independence or safety condition, active-domain convention, both translation directions and semantic equality are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Codd's theorem Domain-specific

Parents (1) — outgoing typed relations

Codd's theorem is a kind of Equivalence-Preserving Rewriting Prime

It remains its own entry because its identity is fixed by the relational schema and finite instance, relational-algebra operators, tuple or domain calculus syntax, free variables and query arity, domain-independence or safety condition, active-domain convention, both translation directions and semantic equality.

Hierarchy paths (2) — routes to 2 parentless roots

Codd's theorem → is a kind of Equivalence-Preserving Rewriting → is a kind of Transformation → is a kind of, typical Function (Mapping)

Show alternative path (1)

Neighborhood in Abstraction Space¶

Codd's theorem sits in a crowded region of the domain-specific corpus (14^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Relational Database Theory (13 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25