The class (up to isomorphism) of all finitely generated — in the usual Fraïssé context: finite — structures that embed into a given countable structure; it records the finite patterns realized inside the structure.

Principle

The age abstracts the local combinatorial data of a structure by listing the isomorphism types of its finite (or finitely generated) substructures; two structures with the same age realize the same finite configurations even if they differ globally.

Demonstration

The age of (Q,<) is the class of all finite linear orders; the age of the Rado graph is the class of all finite simple graphs.

Misapplication

Confusing the age with the set of all substructures without quotienting by isomorphism, or including infinite substructures, or treating age as an elementary (first-order) invariant rather than a purely finite-pattern invariant.

Consequence

Knowing the age constrains possible Fraïssé limits and determines, under amalgamation hypotheses, a canonical countable homogeneous structure; it is the primary invariant in finite-pattern classification problems.

Reversal

Reversing viewpoint, one may start from a class of finite structures (the would-be age) and ask whether it arises as the age of any countable structure, reversing the direction from structure→class to class→structure.

Boundary

Age concerns finitely generated (often finite) substructures only; it does not capture infinite combinatorial or first-order properties such as completeness, compactness, or satisfaction of infinitary sentences.

Semantic Tension

Tension between 'age' and 'theory': age is about finite combinatorial types up to isomorphism, while theory (elementary theory) captures first-order sentences; they overlap but neither determines the other in general.

Synthesis

The age of a structure is the catalogue of its finite (or finitely generated) isomorphism types; it encodes the local finite patterns that, when organized by amalgamation properties, can reconstruct canonical homogeneous structures.