# Axiomatized class

A class of models of one type, defined by an axiom system. A class $K$ of models of a formal language $L$ is said to be axiomatized (finitely axiomatized) if there exists a (finite) system $\Sigma$ of closed formulas of $L$ such that $K$ contains those and only those models on which all formulas of $\Sigma$ are defined and are true (cf. Algebraic system). A class of models of a recursive signature is said to be recursively axiomatized if it can be specified by a recursive set of axioms.

Many classes of algebraic systems studied in mathematics are defined by a system of axioms of a first-order language. For instance, the classes of all Boolean algebras, all groups, all fields, and all lattices are finitely axiomatized. The classes of all torsion-free groups, all fields of characteristic zero and all algebraically closed fields are recursively axiomatized, but not necessarily finitely axiomatized. The theory of axiomatized classes reveals regularities common to all classes of objects defined by a specific language; it has been well developed for first-order languages, and therefore only such classes and formulas will be dealt with in what follows.

Two models are said to be elementarily equivalent if any formula of the first-order language which is true in one of them is also true in the other. A model $\mathfrak M$ is said to be an elementary extension of a model $\mathfrak N$ if any formula which is defined and is true in $\mathfrak N$ is also true in $\mathfrak M$.

An elementary closed class $K$ of models is called complete if all its models are elementarily equivalent. Every axiomatized class of models is a sum of pairwise-disjoint complete classes. A class is said to be categorical in cardinality $\mathfrak m$ if all its models of cardinality $\mathfrak m$ are isomorphic. A complete class of models of a countable signature that is categorical in an uncountable cardinality, is categorical in all uncountable cardinalities, but may be non-categorical in a countable cardinality; in such a case the class has a countable number of pairwise non-isomorphic countable models. For any $n \neq 2$ there exists a complete axiomatized class with exactly $n$ non-isomorphic countable models.

An axiomatized class $K$ of models is called solvable if there exists an algorithm by which it is possible to tell, for any closed formula of the language $L$, if it is true or false for each model in $K$. The following theorem describes the interconnection of complete, categorical and solvable classes: If $K$ is categorical of infinite cardinality and has no finite model, then it is complete. A recursively-complete axiomatized class of models is solvable.

Reductive and projective classes are generalizations of axiomatized clases. Projective classes are defined by a second-order axiom in the form

$$\exists T _ {1} \dots \exists T _ {n} \mathfrak A ( P _ {1} \dots P _ {k} ,\ T _ {1} \dots T _ {n} ),$$

where $P _ {i} , T _ {i}$ are predicate variables, and $\mathfrak A ( P _ {1} \dots P _ {k} , T _ {1} \dots T _ {n} )$ is a formula of the signature $\sigma = ( P _ {1} \dots P _ {k} , T _ {1} \dots T _ {n} )$. Many properties of axiomatized classes can be applied to these classes.

#### References

 [1] A.I. Mal'tsev, "Algebraic systems" , Springer (1973) (Translated from Russian) [2] A.I. Mal'tsev, "Some problems in the theory of classes of models" , Proc. 4-th All-Union Math. Congress (1961) , 1 , Leningrad (1963) pp. 169–198 (In Russian) (Transl. in: Amer. Math. Soc. Transl. (2) 83 (1969), 1–48) [3] P.M. Cohn, "Universal algebra" , Reidel (1981)