For each k 1, let Γk be the countable universal homogeneous k-hypergraph. In this paper, we shall classify the closed permutation groups G such that Aut G Sym. In particular, we shall show that there exist only finitely many such groups G for each k 1. We shall also show that each of the associated reducts of Γk is homogeneous with respect to a finite relational language.

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)

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)

Using the theory of categories as a framework, this book develops a duality theory for theories in first order logic in which the dual of a theory is the category of its models with suitable additional structure. This duality theory resembles and generalizes M. H. Stone's famous duality theory for Boolean algebras. As an application, the author derives a result akin to the well-known definability theorem of E. W. Beth. This new definability theorem is related to theorems of descent in (...) category theory and algebra and can also be stated as a result in pure logic without reference to category theory. Containing novel techniques as well as applications of classical methods, this carefuly written book shows an attention to both organization and detail and will appeal to mathematicians and philosophers interested in category theory. (shrink)