Related papers: Algebraic Presentations of Type Dependency
We study the dependence of a cluster algebra on the choice of coefficients. We write general formulas expressing the cluster variables in any cluster algebra in terms of the initial data; these formulas involve a family of polynomials…
There are many examples of dualities between topological spaces and algebras in the literature. Particularly, many of those examples come from the algebraic counterpart of a logical system, e.g, boolean and heyting algebras, MV-algebras,…
Homotopy type theory is a new branch of mathematics, based on a recently discovered connection between homotopy theory and type theory, which brings new ideas into the very foundation of mathematics. On the one hand, Voevodsky's subtle and…
We introduce Voevodsky's univalent foundations and univalent mathematics, and explain how to develop them with the computer system Agda, which is based on Martin-L\"of type theory. Agda allows us to write mathematical definitions,…
We present a categorical theory of the composition methods in finite model theory -- a key technique enabling modular reasoning about complex structures by building them out of simpler components. The crucial results required by the…
This paper charts a very direct path between the categorical approach to quantum mechanics, due to Abramsky and Coecke, and the older convex-operational approach based on ordered vector spaces (recently reincarnated as "generalized…
We first consider the rational Cherednik algebra corresponding to the action of a finite group on a complex variety, as defined by Etingof. We define a category of representations of this algebra which is analogous to "category O" for the…
We introduce a theory for encoding and manipulating algebraic data on categories via $\textit{concentration structures}$, which are equivalence relations on morphisms that satisfy certain axioms. For any category with a concentration…
In the field of categorical probability, one uses concepts and techniques from category theory, such as monads and monoidal categories, to study the structures of probability and statistics. In this paper, we connect some ideas from…
The universal C*-algebras of discrete product systems generalize the Toeplitz- Cuntz algebras and the Toeplitz algebras of discrete semigroups. We consider a semigroup P which is quasi-lattice ordered in the sense of Nica, and, for a…
The analysis of concurrent and reactive systems is based to a large degree on various notions of process equivalence, ranging, on the so-called linear-time/branching-time spectrum, from fine-grained equivalences such as strong bisimilarity…
The rules governing the essentially algebraic notion of a category with families have been observed (independently) by Steve Awodey and Marcelo Fiore to precisely match those of a representable natural transformation between presheaves.…
Inspired by recent work of Batanin and Berger on the homotopy theory of operads, a general monad-theoretic context for speaking about structures within structures is presented, and the problem of constructing the universal ambient structure…
The logical parallelism of propositional connectives and type constructors extends beyond the static realm of predicates, to the dynamic realm of processes. Understanding the logical parallelism of process propositions and dynamic types was…
We show that certain C*-algebras which have been studied among others by Arzumanian, Vershik, Deaconu, and Renault in connection to a measure preserving transformation of a measure space and/or to a covering map of a compact space are…
We carefully define and study C*-algebras over topological spaces, possibly non-Hausdorff, and review some relevant results from point-set topology along the way. We explain the triangulated category structure on the bivariant Kasparov…
Autonomous systems require the management of several model views to assure properties such as safety and security among others. A crucial issue in autonomous systems design assurance is the notion of emergent behavior; we cannot use their…
The definition of graph automatic groups by Kharlampovich, Khoussainov and Miasnikov and its extension to C-graph automatic by Murray Elder and the first author raise the question of whether Thompson's group F is graph automatic. We define…
What makes two computational systems equivalent? Topos theory answers with classifying toposes: a system's semantic content is encoded in the geometric theory it classifies, and two presentations are equivalent when their classifying…
In 1957, Lacombe initiated a systematic study of the different possible notions of "computable topological spaces". However, he interrupted this line of research, settling for the idea that "computably open sets should be computable unions…