Related papers: Algebraic models of dependent type theory
An algebraic theory, sometimes called an equational theory, is a theory defined by finitary operations and equations, such as the theories of groups and of rings. It is well known that algebraic theories are equivalent to finitary monads on…
A new notion of independence relation is given and associated to it, the class of flat theories, a subclass of strong stable theories including the superstable ones is introduced. More precisely, after introducing this independence…
For each natural number $n$, we define a category whose objects are discriminant algebras in rank $n$, i.e. functorial means of attaching to each rank-$n$ algebra a quadratic algebra with the same discriminant. We show that the discriminant…
Human beings possess the most sophisticated computational machinery in the known universe. We can understand language of rich descriptive power, and communicate in the same environment with astonishing clarity. Two of the many contributors…
Categorification is the process of finding category-theoretic analogs of set-theoretic concepts by replacing sets with categories, functions with functors, and equations between functions by natural isomorphisms between functors, which in…
We complete the foundational architecture of Algebraic Phase Theory by developing a categorical and $2$-categorical framework for algebraic phases. Building on the structural notions introduced in Papers~I-III, we define phase morphisms,…
This paper focuses on natural dualities for varieties of bilattice-based algebras.Such varieties have been widely studied as semantic models in situations where information is incomplete or inconsistent. The most popular tool for studying…
Discrete models have a long tradition in engineering, including finite state machines, Boolean networks, Petri nets, and agent-based models. Of particular importance is the question of how the model structure constrains its dynamics. This…
We introduce the concept of a prenormed model of a particular kind of finitary single-sorted first-order theories, interpreted over a category with finite products. These are referred to as prealgebraic theories, for the fact that their…
We introduce and study a natural class of fields in which certain first-order definable sets are existentially definable, and characterise this class by a number of equivalent conditions. We show that global fields belong to this class, and…
By operations on models we show how to relate completeness with respect to permissive-nominal models to completeness with respect to nominal models with finite support. Models with finite support are a special case of permissive-nominal…
Abstract clones serve as an algebraic presentation of the syntax of a simple type theory. From the perspective of universal algebra, they define algebraic theories like those of groups, monoids and rings. This link allows one to study the…
We present a framework for studying the concept of independence in a general context covering database theory, algebra and model theory as special cases. We show that well-known axioms and rules of independence for making inferences…
The concept of modulation is generalized to pseudo-modulation and its subclasses including pre-modulation, generalized modulation and regular modulation. The motivation is to define the valued analogue of natural quiver, called {\em natural…
This paper presents preliminary work on a general system for integrating dependent types into substructural type systems such as linear logic and linear type theory. Prior work on this front has generally managed to deliver type systems…
The arithmetic of the natural numbers can be extended to arithmetic operations on planar binary trees. This gives rise to a non-commutative arithmetic theory. In this exposition, we describe this arithmetree, first defined by Loday, and…
Let A be an evolution algebra (possibly infinite-dimensional) equipped with a fixed natural basis B, and let E be the associated graph defined by Elduque and Labra. We describe the group of automorphisms of A that are diagonalizable with…
This is my habilitation thesis. As the tradition wants, I tried to give an introduction of my field of research. I post it on the ArXiv with the hope it can be useful to young researchers looking for a short and friendly text on…
Necessary and sufficient conditions are presented for the (first-order) theory of a universal class of algebraic structures (algebras) to admit a model completion, extending a characterization provided by Wheeler. For varieties of algebras…
An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…