Switch to: Citations

Add references

You must login to add references.
  1. Duality and Definability in First Order Logic.Michael Makkai - 1994 - American Mathematical Soc..
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Set Theory: An Introduction to Independence Proofs.Kenneth Kunen - 1980 - North-Holland.
    Download  
     
    Export citation  
     
    Bookmark   169 citations  
  • Strong conceptual completeness for first-order logic.Michael Makkai - 1988 - Annals of Pure and Applied Logic 40 (2):167-215.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Topological representation of geometric theories.Henrik Forssell - 2012 - Mathematical Logic Quarterly 58 (6):380-393.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • A theorem on barr-exact categories, with an infinitary generalization.Michael Makkai - 1990 - Annals of Pure and Applied Logic 47 (3):225-268.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Definability of Sets in Models of Axiomatic Theories.A. Grzegorczyk, A. Mostowski & C. Ryll-Nardzewski - 1969 - Journal of Symbolic Logic 34 (1):126-126.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Reducts of random hypergraphs.Simon Thomas - 1996 - Annals of Pure and Applied Logic 80 (2):165-193.
    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.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Reducts of the random graph.Simon Thomas - 1991 - Journal of Symbolic Logic 56 (1):176-181.
    Download  
     
    Export citation  
     
    Bookmark   11 citations