On generic structures with a strong amalgamation property. (English) Zbl 1178.03042

Summary: Let \({\mathcal L}\) be a finite relational language and \(\alpha= (\alpha_R: R\in{\mathcal L})\) a tuple with \(0<\alpha_R\leq 1\) for each \(R\in{\mathcal L}\). Consider a dimension function
\[ \delta_\alpha(A)= |A|- \sum_{R\in{\mathcal L}}\alpha_R e_R(A) \]
where each \(e_R(A)\) is the number of realizations of \(R\) in \(A\). Let \(K_\alpha\) be the class of finite structures \(A\) such that \(\delta_\alpha(X)\geq 0\) for any substructure \(X\) of \(A\). We show that the theory of the generic model of \(K_\alpha\) is AE-axiomatizable for any \(\alpha\).


03C13 Model theory of finite structures
03C45 Classification theory, stability, and related concepts in model theory
03C50 Models with special properties (saturated, rigid, etc.)
Full Text: DOI


[1] Automorphisms of first-order structures pp 153– (1994)
[2] The strange logic of random graphs (2001) · Zbl 0976.05001
[3] DOI: 10.1016/j.apal.2004.06.006 · Zbl 1068.03029
[4] DOI: 10.1090/S0002-9947-97-01869-2 · Zbl 0952.03029
[5] Kokyuroku of RIMS in Kyoto University 1450 pp 75– (2005)
[6] DOI: 10.1305/ndjfl/1074396310 · Zbl 1050.03025
[7] DOI: 10.1016/0168-0072(95)00027-5 · Zbl 0857.03020
[8] DOI: 10.1007/s11856-007-0077-8 · Zbl 1134.03021
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.