Lax Logical Relations

Lax logical relations are a categorical generalisation of logical relations; though they preserve product types, they need not preserve exponential types. But, like logical relations, they are preserved by the meanings of all lambda-calculus terms.We show that lax logical relations coincide with the correspondences of Schoett, the algebraic relations of Mitchell and the pre-logical relations of Honsell and Sannella on Henkin models, but also generalise naturally to models in cartesian closed categories and to richer languages

Uniform Interpolation for Coalgebraic Fixpoint Logic

We use the connection between automata and logic to prove that a wide class of coalgebraic fixpoint logics enjoys uniform interpolation. To this aim, first we generalize one of the central results in coalgebraic automata theory, namely closure under projection, which is known to hold for weak-pullback preserving functors, to a more general class of functors, i.e.; functors with quasi-functorial lax extensions. Then we will show that closure under projection implies definability of the bisimulation quantifier in the language of coalgebraic fixpoint logic, and finally we prove the uniform interpolation theorem

A categorical approach to the maximum theorem

Berge's maximum theorem gives conditions ensuring the continuity of an optimised function as a parameter changes. In this paper we state and prove the maximum theorem in terms of the theory of monoidal topology and the theory of double categories. This approach allows us to generalise (the main assertion of) the maximum theorem, which is classically stated for topological spaces, to pseudotopological spaces and pretopological spaces, as well as to closure spaces, approach spaces and probabilistic approach spaces, amongst others. As a part of this we prove a generalisation of the extreme value theorem.Comment: 45 pages. Minor changes in v2: this is the final preprint for publication in JPA