A field {\displaystyle K} is pseudo-finite if it satisfies the following three conditions:

Pseudo-finite fields form an elementary class. They were introduced by James Ax, who gave the following alternative characterization: pseudo-finite fields are exactly the infinite models of the theory of finite fields. Here, the "theory of finite fields" is the set of all first order statements which hold in all finite fields. Moreover, Ax showed that the theory of finite fields is recursively axiomatizable, by a variation of the above axioms which weakens each instance of the PAC condition (stated for plane curves), to allow for finitely many finite fields as counter-examples.

In particular, any non-principal ultraproduct of finite fields is pseudo-finite. The main difficulty in proving this fact lies in showing that such non-principal ultraproducts satisfy the PAC condition. This comes from Weil's Riemann Hypothesis for Curves.

Aside from ultraproducts of finite fields, other examples of pseudo-finite fields include:

For {\displaystyle K} pseudo-finite, let {\displaystyle Abs(K)} denote the subfield of {\displaystyle K} consisting of elements algebraic over the prime field. One has the following criterion for elementary equivalence of pseudo-finite fields:

Two pseudo-finite fields {\displaystyle K} and {\displaystyle L} are elementarily equivalent if and only if {\displaystyle Abs(K)} is isomorphic to {\displaystyle Abs(L)}.

The possibilities for {\displaystyle Abs(K)} are essentially the fields of the form {\displaystyle K^{\sigma }}, where {\displaystyle \sigma } is an automorphism of {\displaystyle K}, and {\displaystyle K} is the algebraic closure of {\displaystyle \mathbb {Q} } or a finite field.

Ax's result characterizing pseudo-finite fields as the infinite models of the theory of finite fields has two difficult (deep) steps:

Pseudo-finite fields are closely connected to ACFA, the model companion of difference fields. If {\displaystyle (K,\sigma )} is a model of ACFA, then the fixed field of {\displaystyle \sigma } is always pseudo-finite. Up to elementary equivalence, all pseudo-finite fields arise in this way. Hrushovski’s work on the elementary theory of the Frobenius can be seen as generalizing Ax’s work from pseudo-finite fields to models of ACFA.

The theory of pseudo-finite fields is model complete after adding predicates {\displaystyle SOL_{n}(x_{1},\ldots ,x_{n})}, to be interpreted as {\displaystyle \exists y:y^{n}=x_{1}y^{n-1}+\cdots +x_{n}}. In the ring language, pseudo-finite fields are not model complete.

Pseudo-finite fields are always simple, but not stable. Forking can be described in some way similar to how it can be described in ACFA.

Pseudo-finite fields have strong definable Euler characteristics taking values in {\displaystyle \mathbb {Z} /n\mathbb {Z} } (definable with parameters), arising from the mod {\displaystyle n} counting functions for finite fields. ::: ::: :::