The property of a class of structures or a semantic property that it cannot be captured by any single effective (e.g., recursively enumerable) or finite set of axioms in a given formal language; no axiom system in that language characterizes exactly the intended class.

Principle

When the complexity or expressive mismatch between the property and the chosen logic prevents a recursive or finite axiomatization, the class is nonaxiomatizable within that logic; changing the logic or adding higher-order resources may alter axiomatizability.

Demonstration

The class of all finite graphs is not axiomatizable by any set of first-order sentences because finiteness is not definable in first-order logic; similarly, the set of true arithmetical sentences of the standard model of arithmetic is not recursively enumerable, so it is not effectively axiomatizable.

Misapplication

Confusing nonaxiomatizability with undecidability of individual sentences; a theory can be nonaxiomatizable even if some decision problems about its members are decidable, and vice versa.

Consequence

Nonaxiomatizability indicates a genuine expressive limitation of the chosen formalism and motivates either stronger languages (second-order, infinitary) or alternative semantic frameworks to capture the intended class.

Reversal

Axiomatizability is the opposite: there exists a finite or effectively enumerable set of axioms whose models are precisely the class in question, allowing a single theory to capture the property.

Boundary

This notion depends on the ambient logic (first-order, second-order, higher-order), on whether effectivity (computability) is required, and on whether one allows infinite axiom schemata or only finite axiom sets.

Semantic Tension

Tension appears between wanting a compact, effective axiomatization and allowing greater expressive power; trade-offs exist among decidability, completeness, and expressive resources.

Synthesis

Nonaxiomatizability marks where a chosen logical language cannot single-handedly capture a target class of structures or semantic property; it points to either inherent complexity of the class or the need to broaden logical resources.