The nominal/FM Yoneda Lemma

This paper explores versions of the Yoneda Lemma in settings founded upon FM sets. In particular, we explore the lemma for three base categories: the category of nominal sets and equivariant functions; the category of nominal sets and all finitely supported functions, introduced in this paper; and the category of FM sets and finitely supported functions. We make this exploration in ordinary, enriched and internal settings. We also show that the finite support of Yoneda natural transformations is a theorem for free.

Conditional Independence in Categories

In this talk I shall discuss a general category-theoretic structure for modelling conditional independence. The standard notion of conditional independence in probability theory provides a motivating example. But other rather different examples arise in many contexts: computability theory, nominal sets (used to model `names' in computer science), separation logic (used to reason about heap memory in computer science), and others.Category-theoretic structure common to these examples can be axiomatized by the notion of a category with local independent products, which combines fibrational and symmetric monoidal structure in a somewhat particular way. In the talk I shall expound this notion, and I shall present several illustrative examples of such structure. If time permits, I may also describe some curious connections with topos theory.

Stone duality for first-order logic: a nominal approach to logic and topology

What are variables, and what is universal quantification over a variable?Nominal sets are a notion of `sets with names', and using equational axioms in nominal algebra these names can be given substitution and quantification actions.So we can axiomatise first-order logic as a nominal logical theory.We can then seek a nominal sets representation theorem in which predicates are interpreted as sets; logical conjunction is interpreted as sets intersection; negation as complement.Now what about substitution; what is it for substitution to act on a predicate-interpreted-as-a-set, in which case universal quantification becomes an infinite sets intersection?Given answers to these questions, we can seek notions of topology.What is the general notion of topological space of which our sets representation of predicates makes predicates into `open sets'; and what specific class of topological spaces corresponds to the image of nominal algebras for first-order logic?The classic Stone duality answers these questions for Boolean algebras, representing them as Stone spaces.Nominal algebra lets us extend Boolean algebras to `FOL-algebras', and nominal sets let us correspondingly extend Stone spaces to `∀-Stone spaces'.These extensions reveal a wealth of structure, and we obtain an attractive and self-contained account of logic and topology in which variables directly populate the denotation, and open predicates are interpreted as sets rather than functions from valuations to sets.