Can anybody give a definition of the equalizer completion of a cartesian category? 


Is the method to get more or less as the regular and exact completions in the way that are given in: <http://ncatlab.org/nlab/show/regular+and+exact+completions>? 


How is in that case the behaviour of the forgetful functor FL-->FP (where *FL* are categories with finite limits and *FP* categories with finite products)?



Equalizer completion
There are general results about how to freely add limits or colimits to a category. They are formally dual, but people normally state the colimit variety because they involve the category of presheaves. 


To freely add some class of colimits to a given category $C$, you form the closure of the representables in the presheaf category $[C^{op},\mathsf{Set}]$ under the given type of colimit.


If you want to do this in such a way that certain existing colimits are preserved, then you form the closure not in the presheaf category, but in the full subcategory of those presheaves which send the existing colimits in C into limits in Set. 


So to freely complete a category $C$ with finite products to a category with finite limits, you should look at the Yoneda embedding of $C$ into the opposite $FP(C,Set)^{op}$ of the category $FP(C,\mathsf{Set})$ of finite-product-preserving functors from $C$ to $\mathsf{Set}$. Now take the closure of the representables under finite limits. That is, finite limits in $FP(C,\mathsf{Set})^{op}$, or finite colimits in $FP(C,\mathsf{Set})$. This then gives the value at $C$ of a left biadjoint to the forgetful
2-functor from the 2-category LEX of categories with finite limits to the 2-category FP of categories with finite products.


There is an explicit, syntactic description, due to Andy Pitts. It can be found, for example, in the paper 



> 
> M. Bunge and A. Carboni, The symmetric topos, Journal of Pure and Applied Algebra, 1995.
> 
> 
> 


An object is a pair of maps $f,f':X \to X'$ equipped with a common retraction $r$. A morphism 
from such a pair to $g,g':Y \to Y',s$ consists of an equivalence class, under a suitably defined equivalence relation, of pairs $(a,a')$ where $a:X \to Y$, $a':X'\to Y'$, and the evident diagrams commute. 


