A theory that is logically equivalent to a theory given by a finite set of axioms in the same language; that is, its set of consequences equals the closure of some finite axiomatization.

Principle

Finite axiomatizability captures when infinite conceptual content can be generated from a finite basis; it is a syntactic property reflecting compactness and expressibility in the chosen logic.

Demonstration

The first-order theory of groups is finitely axiomatizable because a finite list of group axioms generates it; by contrast, the class of fields of characteristic zero is not finitely axiomatizable in first-order logic because expressing 'characteristic is not p for any prime p' requires infinitely many sentences.

Misapplication

Assuming finite axiomatizability from pareddown presentations without proof, or presuming that finite axiomatizability implies decidability or completeness, which need not hold.

Consequence

When a theory is finitely axiomatizable one can often present a compact basis for proofs and sometimes obtain simpler classification results; finite bases are also easier to manipulate in automated reasoning.

Reversal

A non‑finitely axiomatizable theory may nonetheless be recursively axiomatizable or axiomatizable by an infinite but recursively enumerable set; reversing the property highlights differences between finiteness, recursiveness, and definability.

Boundary

This notion is relative to the logic and language used (e.g., first-order); a theory may be finitely axiomatizable in a richer language or stronger logic even if not in the original one.

Semantic Tension

Tension arises between finite axiomatizability and model-theoretic properties like compactness: compactness prevents certain global properties from being finitely captured, creating a tradeoff between expressiveness and finite presentation.

Synthesis

A finitely axiomatizable theory is one whose entire deductive content can be compactly generated from a finite set of sentences in the same formal language, a property that influences proof practice and model classification.