Let L be a finite relational language. Fix C a class of finite L-structures which are closed under isomorphisms and
substructures. We want to strengthen the notion of substructure; let
be a relation on pairs from C satisfying:
implies 
and
implies 
for all 
implies
for all 
- If
is an isomorphism and
, then
extends to an isomorphism
for some superset of
with 
Definition. An embedding
is strong if 
Definition. The pair
has the amalgamation property if
then there is a
so that each
embeds strongly into
with the same image for 
Definition. For infinite
and
we say
iff
for 
Definition. For any
the closure of
in
denoted by
is the smallest superset of
satisfying 
Definition. A countable structure
is
-generic if:
- For

- For
if
then there is a strong embedding of
into
over 
has finite closures: for every
is finite.
Theorem. If
has the amalgamation property, then there is a unique
-generic.
The existence proof proceeds in imitation of the existence proof for Fraïssé limits. The uniqueness proof comes from an easy back and forth argument.