Related papers: Functorial Semantics of Second-Order Algebraic The…

In this paper, first-order logic is interpreted in the framework of universal algebra, using the clone theory developed in three previous papers. We first define the free clone T(L, C) of terms of a first order language L over a set C of…

Category theory has foundational importance because it provides conceptual lenses to characterize what is important in mathematics. Originally the main lenses were universal mapping properties and natural transformations. In recent decades,…

We present a mathematical framework for mapping second-order logic relations onto a simple state vector algebra. Using this algebra, basic theorems of set theory can be proven in an algorithmic way, hence by an expert system. We illustrate…

The concept of a clone is central to many branches of mathematics, such as universal algebra, algebraic logic, and lambda calculus. Abstractly a clone is a category with two objects such that one is a countably infinite power of the other.…

Dependently typed proof assistant rely crucially on definitional equality, which relates types and terms that are automatically identified in the underlying type theory. This paper extends type theory with definitional functor laws,…

For slowly varying fields on the scale of the lightest mass the logarithm of the vacuum functional of a massive quantum field theory can be expanded in terms of local functionals satisfying a form of the Schrodinger equation, the principal…

As several different formal systems with inequivalent syntax may describe equivalent semantics, it is possible to find `completions' to more expressive syntaxes that are semantically invariant. Doctrine theory, in the sense of Lawvere, is…

I have argued elsewhere that second order logic provides a foundation for mathematics much in the same way as set theory does, despite the fact that the former is second order and the latter first order, but second order logic is marred by…

In this paper, we use a categorical and functorial set up to model the syntax and inference of logics with algebraic signature, extending previous works on algebraisation of logics. The main feature of this work is that structurality, or…

Functional programming comes in two flavours: one where ``functions are first-class citizens'' (we call this applicative) and one which is based on equations (we call this declarative). In relational programming clauses play the role of…

The attempt is to give a formal concpet of system, and with this provide a definition of category, that will also satisfy the definition of a system. An axiomatic base is given, for constructing the group of integers. In the process, we…

Lawvere observed in his celebrated work on hyperdoctrines that the set-theoretic schema of comprehension can be elegantly expressed in the functorial language of categorical logic, as a comprehension structure on the functor…

We show that differential calculus (in its usual form, or in the general form of topological differential calculus) can be fully imdedded into a functor category (functors from a small category of anchord tangent algebras to anchored sets).…

We study the relationship between cartesian bicategories and a specialisation of Lawvere's hyperdoctrines, namely elementary existential doctrines. Both provide different ways of abstracting the structural properties of logical systems: the…

In this paper we introduce a description of ordered groupoids as a particular type of double categories. This enables us to turn Lawson's correspondence between ordered groupoids and left-cancellative categories into a biequivalence. We use…

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.…

Higher-order quantum theory is an extension of quantum theory where one introduces transformations whose input and output are transformations, thus generalizing the notion of channels and quantum operations. The generalization then goes…

This paper lays the groundwork for the theory of categorical diagonalization. Given a diagonalizable operator, tools in linear algebra (such as Lagrange interpolation) allow one to construct a collection of idempotents which project to each…

Recent developments in the categorical foundations of universal algebra have given fresh impetus to an understanding of the lambda calculus coming from categorical logic: an interpretation is a semi-closed algebraic theory. Scott's…

This paper explores the interplay between category theory, topology, and the algebraic theory of finite groups. Our analysis unfolds in three stages. First, we establish the foundational universe of our objects: the complete and cocomplete…