87 research outputs found
The category of equilogical spaces and the effective topos as homotopical quotients
We show that the two models of extensional type theory, those given by the
category of equilogical spaces and by the effective topos, are homotopical
quotients of categories of 2-groupoids
Geometric Aspects of Multiagent Systems
Recent advances in Multiagent Systems (MAS) and Epistemic Logic within
Distributed Systems Theory, have used various combinatorial structures that
model both the geometry of the systems and the Kripke model structure of models
for the logic. Examining one of the simpler versions of these models,
interpreted systems, and the related Kripke semantics of the logic (an
epistemic logic with -agents), the similarities with the geometric /
homotopy theoretic structure of groupoid atlases is striking. These latter
objects arise in problems within algebraic K-theory, an area of algebra linked
to the study of decomposition and normal form theorems in linear algebra. They
have a natural well structured notion of path and constructions of path
objects, etc., that yield a rich homotopy theory.Comment: 14 pages, 1 eps figure, prepared for GETCO200
Frames and Topological Algebras for a Double-Power Monad
We study the algebras for the double power monad on the Sierpinski space in the Cartesian closed category of equilogical spaces and produce a connection of the algebras with frames. The results hint at a possible synthetic, constructive approach to frames via algebras, in line with that considered in Abstract Stone Duality by Paul Taylor and others
A Convenient Category of Domains
We motivate and define a category of "topological domains",
whose objects are certain topological spaces, generalising
the usual -continuous dcppos of domain theory.
Our category supports all the standard constructions of domain theory,
including the solution of recursive domain equations. It also
supports the construction of free algebras for (in)equational
theories, provides a model of parametric polymorphism,
and can be used as the basis for a theory of computability.
This answers a question of Gordon Plotkin, who asked
whether it was possible to construct a category of domains
combining such properties
A Uniform Approach to Domain Theory in Realizability Models
this paper we provide a uniform approach to modelling them in categories of modest sets. To do this, we identify appropriate structure for doing "domain theory" in such "realizability models". In Sections 2 and 3 we introduce PCAs and define the associated "realizability" categories of assemblies and modest sets. Next, in Section 4, we prepare for our development of domain theory with an analysis of nontermination. Previous approaches have used (relatively complicated) categorical formulations of partial maps for this purpose. Instead, motivated by the idea that A provides a primitive programming language, we consider a simple notion of "diverging" computation within A itself. This leads to a theory of divergences from which a notion of (computable) partial function is derived together with a lift monad classifying partial functions. The next task is to isolate a subcategory of modest sets with sufficient structure for supporting analogues of the usual domain-theoretic constructions. First, we expect to be able to interpret the standard constructions of total type theory in this category, so it should inherit cartesian-closure, coproducts and the natural numbers from modest sets. Second, it should interact well with the notion of partiality, so it should be closed under application of the lift functor. Third, it should allow the recursive definition of partial functions. This is achieved by obtaining a fixpoint object in the category, as defined in (Crole and Pitts 1992). Finally, although there is in principle no definitive list of requirements on such a category, one would like it to support more complicated constructions such as those required to interpret polymorphic and recursive types. The central part of the paper (Sections 5, 6, 7 and 9) is devoted to establish..
Canonical Effective Subalgebras of Classical Algebras as Constructive Metric Completions
We prove general theorems about unique existence of effective subalgebras of classical algebras. The theorems are consequences of standard facts about completions of metric spaces within the framework of constructive mathematics, suitably interpreted in realizability models. We work with general realizability models rather than with a particular model of computation. Consequently, all the results are applicable in various established schools of computability, such as type 1 and type 2 effectivity, domain representations, equilogical spaces, and others
Towards a Convenient Category of Topological Domains
We propose a category of topological spaces that promises to be convenient for the purposes of domain theory as a mathematical theory for modelling computation. Our notion of convenience presupposes the usual properties of domain theory, e.g. modelling the basic type constructors, fixed points, recursive types, etc. In addition, we seek to model parametric polymorphism, and also to provide a flexible toolkit for modelling computational effects as free algebras for algebraic theories. Our convenient category is obtained as an application of recent work on the remarkable closure conditions of the category of quotients of countably-based topological spaces. Its convenience is a consequence of a connection with realizability models
- …