Article ID Journal Published Year Pages File Type
427097 Information and Computation 2011 13 Pages PDF
Abstract

We characterise bicategories of spans, relations and partial maps universally in terms of factorisations involving maps. We apply this characterisation to show that the standard modalities □ and ⋄ arise canonically as extensions of a predicate logic from functions to (abstract) relations. When relations and partial maps are representable, we exhibit logical predicates for the power-object and partial-map-classifier monads. We also show that the □ modality gives the relevant pullbacks of subobjects in the internal logic of categories of partial maps. Organising modal formulae fibrationally, we exhibit an intrinsic relationship between their satisfaction relative to transition systems and the notion of simulation. In this setting, we use the biclosed structure of the bicategory of relations to give a new proof of the standard fact that observational similarity implies similarity.

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics