×

Theories with finitely many models. (English) Zbl 0622.03022

Let \(L_ n\) denote the set of formulas of the first order language L which only make use of n variables. For each \(n\geq 3\) a complete \(L_{2n-1}\)-theory of graphs (with an additional relation) is presented having exactly \((n+1)\) models.
Reviewer: J.Flum

MSC:

03C35 Categoricity and completeness of theories
PDFBibTeX XMLCite
Full Text: DOI