Related papers: Types, Codes and TFTs
These notes present the essentials of first- and second-order monadic logics on strings with introductory purposes. We discuss Monadic First-Order logic and show that it is strictly less expressive than Finite-State Automata, in that it…
With the help of a new program, we do computations concerning the Witten-Reshetikhin-Turaev representations of mapping class groups. In particular we distinguish some mutant fibered knots. The program can be downloaded from…
This paper is a sequel to "Logical systems I: Lambda calculi through discreteness". It provides a general 2-categorical setting for extensional calculi and shows how intensional and extensional calculi can be related in logical systems. We…
We define a once extended non-compact 3-dimensional TQFT $\mathcal{Z}$ from the data of a (potentially) non-semisimple modular tensor category. This is in the framework of generators and relations of [Bartlett et al., arxiv:1509.06811…
Based on different views on the Jones polynomial we review representation theoretic categorified link and tangle invariants. We unify them in a common combinatorial framework and connect them via the theory of Soergel bimodules. The…
In this paper, we give a complete classification of extensions of finite irreducible conformal modules over rank two Lie conformal algebras.
We construct a cohomology theory for oriented links using singular cobordisms and a special type of 2-dimensional Topological Quantum Field Theory (TQFT), categorifying the quantum sl(2) invariant. In particular, we give a description of…
This paper contains three related groupings of results. First, we consider a new notion of an admissible skein module of a surface associated to an ideal in a (non-semisimple) pivotal category. Second, we introduce the notion of a chromatic…
The lattice definition of a two-dimensional topological field theory (TFT) is given generically, and the exact solution is obtained explicitly. In particular, the set of all lattice topological field theories is shown to be in one-to-one…
It is known that for any full rational conformal field theory, the correlation functions that are obtained by the TFT construction satisfy all locality, modular invariance and factorization conditions, and that there is a small set of…
Over the past two decades several fragments of first-order logic have been identified and shown to have good computational and algorithmic properties, to a great extent as a result of appropriately describing the image of the standard…
We apply the cobordism hypothesis with singularities to the case of affine Rozansky--Witten models, providing a construction of extended TQFTs that includes all line and surface defects. On a technical level, this amounts to proving that…
A remarkable result at the intersection of number theory and group theory states that the order of a finite group $G$ (denoted $|G|$) is divisible by the dimension $d_R$ of any irreducible complex representation of $G$. We show that the…
The present work presents some results about the categorial relation between logics and its categories of structures. A (propositional, finitary) logic is a pair given by a signature and Tarskian consequence relation on its formula algebra.…
We construct a certain `cobordism category' ${\cal D}$ whose morphisms are suitably decorated cobordism classes between similarly decorated closed oriented 1-manifolds, and show that there is essentially a bijection between…
The goal of this work is to describe a categorical formalism for (Extended) Topological Quantum Field Theories (TQFTs) and present them as functors from a suitable category of cobordisms with corners to a linear category, generalizing 2d…
A construction that assigns a Boolean 1D TQFT with defects to a finite state automaton was recently developed by Gustafson, Im, Kaldawy, Khovanov, and Lihn. We show that the construction is functorial with respect to the category of finite…
In this paper, the second of two companion pieces, we explore novel philosophical questions raised by recent progress in large language models (LLMs) that go beyond the classical debates covered in the first part. We focus particularly on…
A type theory is presented that combines (intuitionistic) linear types with type dependency, thus properly generalising both intuitionistic dependent type theory and full linear logic. A syntax and complete categorical semantics are…
Rational word languages can be defined by several equivalent means: finite state automata, rational expressions, finite congruences, or monadic second-order (MSO) logic. The robust subclass of aperiodic languages is defined by: counter-free…