A functor between regular categories is called regular, if it preserves finite limits and coequalizers of kernel pairs. A functor is regular if and only if it preserves finite limits and exact sequences. For this reason, regular functors are sometimes called exact functors. Functors that preserve finite limits are often said to be left exact. Regular logic and regular categories Regular logic is the fragment of first-order logic that can express statements of the form where and are regular formulae i.e. formulae built up from atomic formulae, the truth constant, binary meets (conjunction) and existential quantification. Such formulae can be interpreted in a regular category, and the interpretation is a model of a sequent , if the interpretation of factors through the interpretation of . This gives for each theory (set of sequents) T and for each regular category C a category Mod(T,C) of models of T in C. This construction gives a functor Mod(T,-):RegCat→Cat from the category RegCat of small regular categories and regular functors to small categories. It is an important result that for each theory T there is a regular category R(T), such that for each regular category C there is an equivalence which is natural in C. Here, R(T) is called the classifying category of the regular theory T. Up to equivalence any small regular category arises in this way as the classifying category of some regular theory. Exact (effective) categories The theory of equivalence relations is a regular theory. An equivalence relation on an object of a regular category is a monomorphism into that satisfies the interpretations of the conditions for reflexivity, symmetry and transitivity. Every kernel pair defines an equivalence relation . Conversely, an equivalence relation is said to be effective if it arises as a kernel pair. An equivalence relation is effective if and only if it has a coequalizer and it is the kernel pair of this. A regular category is said to be exact, or exact in the sense of Barr, or effective regular', if every equivalence relation is effective. (Note that the term "exact category" is also used differently, for the exact categories in the sense of Quillen.) Examples of exact categories The category of sets is exact in this sense, and so is any (elementary) topos. Every equivalence relation has a coequalizer, which is found by taking equivalence classes. Every abelian category is exact. Every category that is monadic