Related papers: Initial Algebras Unchained -- A Novel Initial Alge…
Quasi-set theory was proposed as a mathematical context to investigate collections of indistinguishable objects. After presenting an outline of this theory, we define an algebra that has most of the standard properties of an orthocomplete…
We develop a novel formal theory of finite structures, based on a view of finite structures as a fundamental artifact of computing and programming, forming a common platform for computing both within particular finite structures, and in the…
The concept of a Kleene algebra (sometimes also called Kleene lattice) was already generalized by the first author for non-distributive lattices under the name pseudo-Kleene algebra. We extend these concepts to posets and show how…
A module endomorphism $f$ on an algebra $A$ is called an averaging operator if it satisfies $f(xf(y)) = f(x)f(y)$ for any $x, y\in A$. An algebra $A$ with an averaging operator $f$ is called an averaging algebra. Averaging operators have…
Denotational semantics can be based on algebras with additional structure (order, metric, etc.) which makes it possible to interpret recursive specifications. It was the idea of Elgot to base denotational semantics on iterative theories…
It was shown by Ostrik (2003) and Natale (2017) that a collection of twisted group algebras in a pointed fusion category serve as explicit Morita equivalence class representatives of indecomposable, separable algebras in such categories. We…
Algebraic logic studies algebraic theories related to proposition and first-order logic. A new algebraic approach to first-order logic is sketched in this paper. We introduce the notion of a quantifier theory, which is a functor from the…
A new totally algebraic formalism based on general, abstract ladder operators has been proposed. This approach heavily grounds in the superoperator formalism of Primas. However it is necessary to introduce many improvements in his…
In 1976 S. Eilenberg and M.-P. Sch\"{u}tzenberger posed the following diabolical question: if $\mathbf{A}$ is a finite algebraic structure, $\Sigma$ is the set of all identities true in $\mathbf{A}$, and there exists a finite subset $F$ of…
We give a categorification of the notion of a mathematical structure originally given by Bourbaki in their set theory textbook. We show that any isomorphism-invariant property of a finite structure can be computed by counting the number of…
We extend Ueda's peak set theorem for subdiagonal subalgebras of tracial finite von Neumann algebras, to sigma-finite von Neumann algebras (that is, von Neumann algebras with a faithful state; which includes those on a separable Hilbert…
As mathematical induction is applied to prove statements on natural numbers, {\it continuous induction} (or, {\it real induction}) is a tool to prove some statements in real analysis.(Although, this comparison is somehow an overstatement.)…
The goal of this note is to give an explicit formula for the residues of twists of the matrix algebra in terms of the twisting cocycle. Combined with the Fixed Point Theorem for actions of finite groups on affine buildings, this leads to a…
We define the algebraic cobordism of $\infty$-categories equipped with universal line bundle data as an initial oriented functor in the associated span category. In the standard motivic framework, this recovers the Thom spectrum model…
For any additive functor from modules (or, more generally, from an abelian category with enough projectives or injectives), we construct long sequences tying up together the derived functors, the satellites, and the stabilizations of the…
This study presents a systematic approach to specifying data objects with the help of initial algebras. The primary aim is to describe the set-up to be found in modern functional programming languages such as Haskell and ML, although it can…
Let $K$ be an infinite field and let $I = (f_1,\cdots,f_r)$ be an ideal in the polynomial ring $R = K[x_1,\cdots,x_n]$ generated by generic forms of degrees $d_1,\cdots,d_r$. A longstanding conjecture by Fr\"{o}berg predicts the shape of…
Given a field $K$ and an ample (not necessarily Hausdorff) groupoid $G$, we define the concept of a line bundle over $G$ inspired by the well known concept from the theory of C*-algebras. If $E$ is such a line bundle, we construct the…
Coalgebras for a functor model different types of transition systems in a uniform way. This paper focuses on a uniform account of finitary logics for set-based coalgebras. In particular, a general construction of a logic from an arbitrary…
To find consistent initial data points for a system of differential-algebraic equations, requires the identification of its missing constraints. An efficient class of structural methods exploiting a dependency graph for this task was…