Uploaded October 2025 | Updated November 2026, 3 hours ago
Topos Institute Colloquium, 2nd of October 2025.
———
I'll introduce the notion of instance of a model of a double theory. I'm motivated by the analogy that, as a category $C$ is to its $C$-sets, so a model of an arbitrary double theory $\mathbb{D}$ (that is, a lax double functor $\mathbb{D}\to\mathbb{S}\mathbf{pan}$) is to its instances. The motivating case of the analogy arises precisely when we set $\mathbb{D}$ to be the terminal double theory.
Thus the theory of instances can be seen as a chapter of categorical database theory. Beyond the most fundamental case, introduced by Spivak and Kent, of a database schema as a small category $C$ of "types" and "attributes", or "tables" and "foreign keys", and a database as a $C$-set, the concept of instance encompasses such known extensions as to Baas, Fairbanks, Lynch, and Patterson's attributed $C$-sets, as well as to Schultz, Spivak, Vasilakopoulou, and Wisknesky's algebraic profunctors. From broader motivations, such structures as multifunctors from a multicategory to $\mathbf{Set}$ and models of a Lawvere theory are also instances of "instances."
I'll describe the category of instances of models of simple double theories, as well, hopefully, as introducing the story for models of the modal double theories recently introduced into our CatColab tool as our main approach for handling categorical structures including multi-ary operations. I'll aim to explain how quite a lot of the standard theory of $C$-sets generalizes beyond the terminal double theory. For instance, I'll give a comprehensive factorization system on the category of models of a double theory, together with a Grothendieck construction giving an equivalence between the category of discrete opfibrations over a model $X$ and the category of $X$-instances.
Topos Institute Colloquium, 2nd of October 2025.
———
I'll introduce the notion of instance of a model of a double theory. I'm motivated by the analogy that, as a category $C$ is to its $C$-sets, so a model of an arbitrary double theory $\mathbb{D}$ (that is, a lax double functor $\mathbb{D}\to\mathbb{S}\mathbf{pan}$) is to its instances. The motivating case of the analogy arises precisely when we set $\mathbb{D}$ to be the terminal double theory.
Thus the theory of instances can be seen as a chapter of categorical database theory. Beyond the most fundamental case, introduced by Spivak and Kent, of a database schema as a small category $C$ of "types" and "attributes", or "tables" and "foreign keys", and a database as a $C$-set, the concept of instance encompasses such known extensions as to Baas, Fairbanks, Lynch, and Patterson's attributed $C$-sets, as well as to Schultz, Spivak, Vasilakopoulou, and Wisknesky's algebraic profunctors. From broader motivations, such structures as multifunctors from a multicategory to $\mathbf{Set}$ and models of a Lawvere theory are also instances of "instances."
I'll describe the category of instances of models of simple double theories, as well, hopefully, as introducing the story for models of the modal double theories recently introduced into our CatColab tool as our main approach for handling categorical structures including multi-ary operations. I'll aim to explain how quite a lot of the standard theory of $C$-sets generalizes beyond the terminal double theory. For instance, I'll give a comprehensive factorization system on the category of models of a double theory, together with a Grothendieck construction giving an equivalence between the category of discrete opfibrations over a model $X$ and the category of $X$-instances.
![[DOTS Lectures] 18. State Sharing Pt. 1
Part of a lecture series on the Double Operadic Theory of Systems (DOTS) presented by David Jaz Myers.
Some material from these lectures can be found in Davids book on categorical systems theory:
https://www.davidjaz.com/Papers/DynamicalBook.pdf [DOTS Lectures] 18. State Sharing Pt. 1](https://i.ytimg.com/vi/1cuW-LD41Eo/mqdefault.jpg)

![[Oxford Seminar] Samuel George-White | Advancing human-machine interface systems through AI
Oxford Seminar, 22nd of May 2025
Full Title: Advancing human-machine interface systems through artificial intelligence
Abstract: This study explores the use of artificial intelligence to improve human–machine interaction by decoding neural intent from non-invasive muscle signals. Using a GO/NO-GO task, we recorded high-density electromyography (HD-EMG) and EEG data from participants during movement preparation and cancellation. After preprocessing the data — including filtering, dimensionality reduction (PCA), and normalization — we trained a convolutional neural network to classify different movement-related brain states. The model achieved 72.4% accuracy in distinguishing two functional states and 49.6% in three-class classification. Visualization techniques such as GradCAM and temporal sliding windows were used to interpret model decisions and understand how neural signals evolve over time. These findings highlight the potential of using surface EMG to decode brain activity, paving the way for more intuitive control in applications like prosthetics, rehabilitation, and real-time assistive technologies. [Oxford Seminar] Samuel George-White | Advancing human-machine interface systems through AI](https://i.ytimg.com/vi/2k8w-uNcRpg/mqdefault.jpg)
![[Oxford Seminar] Q Le | Enriched Categories Applied to Qualia Spaces
Oxford Seminar, 7th of August 2025
Recently, Tsuchiya and Saigo used Category Theory to formalise relationships between experiences [1]. In particular, they used Enriched Category Theory to model qualia structure based on similarity judgements, applying it to the case of colour similarity [2]. Within their paper and general work, they advocate for a certain view of categorical consciousness based on Yonedas Lemma, which could characterise a quale as its relationship to all other qualia. But is this right?
In this talk, well consider and answer three core questions from their paper:
1. From the paper itself, What kinds of relations (including similarity) can form an enriched category?
2. Does their categorical approach work?
3. What are other applications of enriched category theory to consciousness?
[1] Tsuchiya, N. and Saigo, H. (2021) A relational approach to consciousness: categories of level and contents of consciousness. Neuroscience of consciousness. [Online] 2021 (2), niab034–niab034
[2] Tsuchiya, N., Phillips, S. and Saigo, H. (2022) ‘Enriched Category as a model of qualia structure based on similarity judgements’, Consciousness and Cognition. [Online] 101 (103319).
date: 2025-08-07 [Oxford Seminar] Q Le | Enriched Categories Applied to Qualia Spaces](https://i.ytimg.com/vi/2lfa93Ubqdg/mqdefault.jpg)
![[Oxford Seminar] Xiaoyan Li | A novel modular and compositional framework for System Dynamics
Oxford Seminar, 27th of February 2025
Title: A next-generation modular and compositional framework for System Dynamics modeling and beyond
System Dynamics (SD) is a powerful methodology for understanding and managing complex systems over time, with applications in various fields such as public health, business, and environmental management. Despite its strengths, traditional System Dynamics modeling methods face several critical limitations, including a lack of modularity, inadequate representation of complex relationships, stratification that obscures model transparency, rigid coupling of model syntax and semantics, and limited support for model composition and reuse. These challenges restrict the scalability, adaptability, and accuracy of models, particularly when applied to large-scale or interdisciplinary systems.
To address these limitations, this presentation introduces a novel framework grounded in Applied Category Theory (ACT), which provides a rigorous mathematical foundation for representing, relating, composing, and stratifying complex systems. By leveraging ACT, this research establishes a next-generation SD modeling approach that integrates mathematical rigor with practical utility, significantly enhancing the flexibility, expressiveness, and applicability of System Dynamics for researchers and practitioners across various domains.
To contextualize System Dynamics modeling in the realm of infectious disease simulation, the presentation will begin with an overview of a COVID-19 theory-based machine learning model, developed incorporating the Bayesian methodology of Particle Filtering algorithm to a Covid-19 System Dynamics model. This model played a pivotal role in supporting decision-making across 17 Canadian jurisdictions during the COVID-19 pandemic by providing daily transmission monitoring, short-term projections, and counterfactual intervention analysis over a year. [Oxford Seminar] Xiaoyan Li | A novel modular and compositional framework for System Dynamics](https://i.ytimg.com/vi/2zS8Kwjavyo/mqdefault.jpg)
![[Berkeley Seminar] William Troiani | Programs as Singularities
Speaker: William Troiani (https://williamtroiani.github.io/)
Title: Programs as Singularities: differentiable computation and the geometry of Bayesian model selection
Abstract: I will describe a setting in which the internal structure of an algorithm becomes visible to Bayesian statistics. Using differentiable linear logic and its vector-space semantics, ordinary Turing-machine codes can be embedded into a smooth space of noisy codes, where perturbations correspond to read errors on the description tape of a universal Turing machine. This turns a program into a point in the parameter space of a statistical model, whose local geometry records how its output probabilities change under perturbation. I will explain how singular learning theory enters through local Bayesian evidence: when comparing neighbourhoods of candidate implementations, the asymptotics are controlled by the local learning coefficient. The main theorem identifies Taylor coefficients of the induced error/loss germ with weighted counts of error syndromes in the underlying computation. As a consequence, runtime error correction forces high-order flatness of the associated statistical singularity and yields bounds on the local learning coefficient. I will close by discussing this as an example of structural Bayesianism: the idea that Bayesian inference can be sensitive not only to what a model predicts, but also to how those predictions are algorithmically implemented.
Date: May 12, 2026 [Berkeley Seminar] William Troiani | Programs as Singularities](https://i.ytimg.com/vi/3DwkYrleuLU/mqdefault.jpg)
![[2-torial] David tells Joanna about algebraic patterns
[2-torial] David tells Joanna about algebraic patterns [2-torial] David tells Joanna about algebraic patterns](https://i.ytimg.com/vi/3VP3ZfgfpTg/mqdefault.jpg)

![[Berkeley Seminar] Evan Patterson | How to Prove Equations Using Diagrams
Title: How to Prove Equations Using Diagrams: A Category Theorist Looks at E-Graphs
Abstract: First invented in 1980, e-graphs are receiving new attention as a powerful and adaptable data structure to keep the books for equational reasoning. In this talk on work in progress, we explore an operational semantics for e-graphs based on category-theory. We argue that classic concepts from category theory, particularly diagrams and initial functors, provide a conceptual foundation for the diagrammatic reasoning performed in e-graphs.
https://topos.institute/blog/2025-05-27-e-graphs-1/
Date: 2025-05-20
https://topos.institute/events/berkeley-seminar/ [Berkeley Seminar] Evan Patterson | How to Prove Equations Using Diagrams](https://i.ytimg.com/vi/3wLDkjocE2c/mqdefault.jpg)

![[Berkeley Seminar] David Jaz Myers | Categorical Algebra with Segal Conditions
Title: Categorical Algebra with Segal Conditions
Abstract: There are many ways to present algebraic structures categorically: monads, Lawvere theories, limit sketches, and more. In this talk, well learn about Yet Another Way to Present Algebra (YAWPA): Segal conditions and Chu and Haugsengs algebraic patterns. The basic idea behind algebraic patterns is that in many cases of categorical algebra we have a notion of *pasting diagram* which tells us how we are going to compose things. These pasting diagrams are made out of elementary features things like boxes and wires and can swallow other diagrams whole by putting subdiagrams into boxes. These two kinds of morphisms, diagram inclusions and swallowings, organize into a factorization system on a category of pasting diagrams. Presheaves on this category of diagrams which send any pasting diagram to the limit over all its elementary subdiagrams is an algebra composing according to those pasting diagrams; that single axiom is the so-called Segal condition. Well see how this works for categories and double categories in particular, and, time-permitting, see how to derive the notion of virtual double category from the algebraic pattern for categories and muse about the appropriate virtual triple categories which are similarly derived from the algebraic pattern for double categories.
https://topos.institute/events/berkeley-seminar/ [Berkeley Seminar] David Jaz Myers | Categorical Algebra with Segal Conditions](https://i.ytimg.com/vi/52AsVTxHXU0/mqdefault.jpg)