Related papers: Types, Codes and TFTs
In this paper we use finite vector spaces (finite dimension, over finite fields) as a non-standard computational model of linear logic. We first define a simple, finite PCF-like lambda-calculus with booleans, and then we discuss two finite…
The paper explains the connection between topological theories for one-manifolds with defects and values in the Boolean semiring and automata and their generalizations. Finite state automata are closely related to regular languages. To each…
Refinement types sharpen systems of simple and dependent types by offering expressive means to more precisely classify well-typed terms. We present a system of refinement types for LF in the style of recent formulations where only canonical…
We construct symmetric monoidal higher categories of iterated Calabi-Yau cospans, that are noncommutative analogs of iterated lagrangian correspondences. We actually give a general (and functorial) procedure that applies to iterated…
Generalized metrics, arising from Lawvere's view of metric spaces as enriched categories, have been widely applied in denotational semantics as a way to measure to which extent two programs behave in a similar, although non equivalent, way.…
We consider Abelian topological quantum field theories (TQFTs) in 3d and show that gaugings of invertible global symmetries naturally give rise to additive codes. These codes emerge as nonanomalous subgroups of the 1-form symmetry group,…
The goal of the paper is an exposition of the simplest $(2+1)$-TQFTs in a sense following a pictorial approach. In the end, we fell short on details in the later sections where new results are stated and proofs are outlined. Comments are…
Twisted loop algebras of the second kind are infinite-dimensional Lie algebras that are constructed from a semisimple Lie algebra and an automorphism on it of order at most $2$. They are examples of equivariant map algebras. The…
Permutations can be viewed as pairs of linear orders, or more formally as models over a signature consisting of two binary relation symbols. This approach was adopted by Albert, Bouvel and F\'eray, who studied the expressibility of…
Linear relations, defined as submodules of the direct sum of two modules, can be viewed as objects that carry dynamical information and reflect the inherent uncertainty of sampled dynamics. These objects also provide an algebraic structure…
We develop a second-order extension of intuitionistic modal logic, allowing quantification over propositions, both syntactically and semantically. A key feature of second-order logic is its capacity to define positive connectives from the…
We present an extension of the Temporal Logic Synthesis Format (TLSF). TLSF builds on standard LTL, but additionally supports high-level constructs, such as sets and functions, as well as parameters that allow a specification to define a…
Two-dimensional conformal field theory (CFT) can be defined through its correlation functions. These must satisfy certain consistency conditions which arise from the cutting of world sheets along circles or intervals. The construction of a…
Topological orders are a prominent paradigm for describing quantum many-body systems without symmetry-breaking orders. We present a topological quantum field theoretical (TQFT) study on topological orders in five-dimensional spacetime…
We use Kan injectivity to axiomatise concepts in the 2-category of topoi. We showcase the expressivity of this language through many examples, and we establish some aspects of the formal theory of Kan extension in this 2-category (pointwise…
A theory T is tight if different deductively closed extensions of T (in the same language) cannot be bi-interpretable. Many well-studied foundational theories are tight, including PA [Visser2006], ZF, Z2, and KM [enayat2017]. In this…
We elaborate on the resurgence analysis on the $T\overline{T}$-deformed 2d conformal field theory (CFT). Writing the deformed partition function as an infinite series in the deformation parameter $\lambda$, we develop efficient analytical…
This PhD Thesis is devoted to the study of Hodge structures on a special type of complex algebraic varieties, the so-called character varieties. For this purpose, we propose to use a powerful algebro-geometric tool coming from theoretical…
We introduce a logic, called LT, to express properties of transductions, i.e. binary relations from input to output (finite) words. In LT, the input/output dependencies are modelled via an origin function which associates to any position of…
The heterogeneity of tools that support temporal logic formulae poses several challenges in terms of interoperability. In particular, a standard syntax for temporal logic on finite traces, despite similar to the one for infinite traces, is…