Results 1 
6 of
6
Topological Completeness for HigherOrder Logic
 Journal of Symbolic Logic
, 1997
"... Using recent results in topos theory, two systems of higherorder logic are shown to be complete with respect to sheaf models over topological spacessocalled "topological semantics". The first is classical higherorder logic, with relational quantification of finitely high type; the second sy ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
Using recent results in topos theory, two systems of higherorder logic are shown to be complete with respect to sheaf models over topological spacessocalled "topological semantics". The first is classical higherorder logic, with relational quantification of finitely high type; the second system is a predicative fragment thereof with quantification over functions between types, but not over arbitrary relations. The second theorem applies to intuitionistic as well as classical logic.
Syntax and Semantics of the logic ...
, 1997
"... In this paper we study the logic L !! , which is first order logic extended by quantification over functions (but not over relations). We give the syntax of the logic, as well as the semantics in Heyting categories with exponentials. Embedding the generic model of a theory into a Grothendieck t ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
In this paper we study the logic L !! , which is first order logic extended by quantification over functions (but not over relations). We give the syntax of the logic, as well as the semantics in Heyting categories with exponentials. Embedding the generic model of a theory into a Grothendieck topos yields completeness of L !! with respect to models in Grothendieck toposes, which can be sharpened to completeness with respect to Heyting valued models. The logic L !! is the strongest for which Heyting valued completeness is known. Finally, we relate the logic to locally connected geometric morphisms between toposes.
FirstOrder Logical Duality
, 2008
"... Generalizing Stone duality for Boolean algebras, an adjunction between Boolean coherent categories—representing firstorder syntax—and certain topological groupoids—representing semantics—is constructed. The embedding of a Boolean algebra into a frame of open sets of a space of 2valued models is re ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Generalizing Stone duality for Boolean algebras, an adjunction between Boolean coherent categories—representing firstorder syntax—and certain topological groupoids—representing semantics—is constructed. The embedding of a Boolean algebra into a frame of open sets of a space of 2valued models is replaced by an embedding of a Boolean coherent category, B, into a topos of equivariant sheaves on a topological groupoid of setvalued models and isomorphisms between them. The latter is a groupoid representation of the topos of coherent sheaves on B, analogously to how the Stone space of a Boolean algebra is a spatial representation of the ideal completion of the algebra, and the category B can then be recovered from its semantical groupoid, up to pretopos completion. By equipping the groupoid of sets and bijections with a particular topology, one obtains a particular topological groupoid which plays a role analogous to that of the discrete space 2, in being the dual of the object classifier and the object one ‘homs into ’ to recover a Boolean coherent category from its semantical groupoid. Both parts of the adjunction, then, consist of ‘homming into sets’, similarly to how both parts of the equivalence between Boolean algebras and Stone spaces consist of ‘homming into 2’. By slicing over this groupoid (modified to display an alternative setup), Chapter 3 shows how the adjunction specializes to the case of firstorder single sorted logic to yield an adjunction between such theories and an independently characterized slice category of topological groupoids such that the counit component at a theory is an isomorphism. Acknowledgements I would like, first and foremost, to thank my supervisor Steve Awodey. I would like to thank the members of the committee: Jeremy Avigad, Lars
Sheaf Representation for Topoi
, 1997
"... It is shown that every (small) topos is equivalent to the category of global sections of a sheaf of socalled hyperlocal topoi, improving on a result of Lambek & Moerdijk. It follows that every boolean topos is equivalent to the global sections of a sheaf of wellpointed topoi. Completeness theo ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
It is shown that every (small) topos is equivalent to the category of global sections of a sheaf of socalled hyperlocal topoi, improving on a result of Lambek & Moerdijk. It follows that every boolean topos is equivalent to the global sections of a sheaf of wellpointed topoi. Completeness theorems for higherorder logic result as corollaries. The main result of this paper is the following. Theorem (Sheaf representation for topoi). For any small topos E, there is a sheaf of categories e E on a topological space, such that: (i) E is equivalent to the category of global sections of e E, (ii) every stalk of e E is a hyperlocal topos. Moreover, E is boolean just if every stalk of e E is wellpointed. Before defining the term "hyperlocal," we indicate some of the background of the theorem. The original and most familiar sheaf representations are for commutative rings (see [12, ch. 5] for a survey); e.g. a wellknown theorem due to Grothendieck [9] asserts that every commutative r...
Topological Representation of the &ambda;Calculus
, 1998
"... The calculus can be represented topologically by assigning certain spaces to the types and certain continuous maps to the terms. Using a recent result from category theory, the usual calculus of conversion is shown to be deductively complete with respect to such topological semantics. It is al ..."
Abstract
 Add to MetaCart
The calculus can be represented topologically by assigning certain spaces to the types and certain continuous maps to the terms. Using a recent result from category theory, the usual calculus of conversion is shown to be deductively complete with respect to such topological semantics. It is also shown to be functionally complete, in the sense that there is always a "minimal" topological model, in which every continuous function is definable. These results subsume earlier ones using cartesian closed categories, as well as those employing socalled Henkin and Kripke models. Introduction The calculus originates with Church [6]; it is intended as a formal calculus of functional application and specification. In this paper, we are mainly interested in the version known as simply typed calculus ; as is now wellknown, the untyped version can be treated as a special case of this ([17]). We present here a topological representation of the calculus: types are represented by cert...
Abstract
, 2010
"... From alogical pointof view, Stoneduality for Boolean algebras relates theories in classical propositional logic and their collections of models. The theories can be seen as presentations of Boolean algebras, and the collections of models can be topologized in such a way that the theory can be recove ..."
Abstract
 Add to MetaCart
From alogical pointof view, Stoneduality for Boolean algebras relates theories in classical propositional logic and their collections of models. The theories can be seen as presentations of Boolean algebras, and the collections of models can be topologized in such a way that the theory can be recovered from its space of models. The situation can be cast as a formal duality relating two categories of syntax and semantics, mediated by homming into a common dualizing object, in this case 2. In the present work, we generalize the entire arrangement from propositional to firstorder logic. Boolean algebras are replaced by Booleancategories presentedbytheoriesinfirstorderlogic, andspaces of models are replaced by topological groupoids of models and their isomorphisms. A duality between the resulting categories of syntax and semantics, expressed first in the form of a contravariant adjunction, is established by homming into a common dualizing object, now Sets, regarded once as a boolean category, and once as a groupoid equipped with an intrinsic topology.