Using Butz and Moerdijk's topological groupoid representation of a topos with enough points, a ‘syntax-semantics’ duality for geometric theories is constructed. The emphasis is on a logical presentation, starting with a description of the semantic topological groupoid of models and isomorphisms of a theory. It is then shown how to extract a theory from equivariant sheaves on a topological groupoid in such a way that the result is a contravariant adjunction between theories and groupoids, the restriction of which is a (...) duality between theories with enough models and semantic groupoids. Technically a variant of the syntax-semantics duality constructed in 1 for first-order logic, the construction here works for arbitrary geometric theories and uses a slice construction on the side of groupoids—reflecting the use of ‘indexed’ models in the representation theorem—which in several respects simplifies the construction and the characterization of semantic groupoids. (shrink)

We develop a duality theory for small Boolean pretoposes in which the dual of the [italic capital]T is the groupoid of models of a Boolean pretopos [italic capital]T equipped with additional structure derived from ultraproducts. The duality theorem states that any small Boolean pretopos is canonically equivalent to its double dual. We use a strong version of the duality theorem to prove the so-called descent theorem for Boolean pretoposes which says that category of descent data derived from a conservative pretopos (...) morphism between Boolean pretoposes is canonically equivalent to the domain-pretopos. The descent theorem contains the Beth definability theorem for classical first order logic. Moreover, it gives, via the standard translation from the language of categories to symbolic logic, a new definability theorem for classical first order logic concerning set-valued functors on models, expressible in purely syntactical (arithmetical) terms. (shrink)

Let C be a small Barr-exact category, Reg the category of all regular functors from C to the category of small sets. A form of M. Barr's full embedding theorem states that the evaluation functor e : C →[Reg, Set ] is full and faithful. We prove that the essential image of e consists of the functors that preserve all small products and filtered colimits. The concept of κ-Barr-exact category is introduced, for κ any infinite regular cardinal, and the natural (...) generalization to κ-Barr-exact categories of the above result is proved. The treatment combines methods of model theory and category theory. Some applications to module categories are given. (shrink)