Related papers: B-systems
The paper examines machines of the type of the $\Gamma$-spaces of Segal which describe homotopy structures on topological spaces. The main result of the paper shows that for any such machine one can find an algebraic theory characterizing…
We consider three (2-)categories and their (anti-)equivalence. They are the category of small abelian categories and exact functors, the category of definable additive categories and interpretation functors, the category of locally coherent…
We continue the investigation of tabular algebras with trace (a certain class of associative ${\Bbb Z}[v, v^{-1}]$-algebras equipped with distinguished bases) by determining the extent to which the tabular structure may be recovered from a…
We exhibit two relation algebra atom structures such that they are elementarily equivalent but their term algebras are not. This answers Problem 14.19 in the book Hirsch, R. and Hodkinson, I., "Relation Algebras by Games", North-Holland,…
Composite theories are the algebraic equivalent of distributive laws. In this paper, we delve into the details of this correspondence and concretely show how to construct a composite theory from a distributive law and vice versa. Using term…
Given two C*-algebras A and B, abstract A-B bimodules that can be isometrically represented as operator bimodules are characterised in terms of their norm. Various properties of such bimodules are given. Their theory is very similar to…
We use the theory of bialgebras to provide the algebraic background for state space realization theorems for input-output maps of control systems. This allows us to consider from a common viewpoint classical results about formal state space…
Temporal logics are an obvious high-level descriptive companion formalism to dynamical systems which model behavior as deterministic evolution of state over time. A wide variety of distinct temporal logics applicable to dynamical systems…
The algebraic analysis of social systems, or algebraic social network analysis, refers to a collection of methods designed to extract information about the structure of a social system represented as a directed graph. Central among these…
The relative cell complexes with respect to a generating set of cofibrations are an important class of morphisms in any model structure. In the particular case of the standard (algebraic) model structure on $\textbf{Top}$, we give a new…
We survey the model theory of operator systems and C$^*$-algebras.
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…
It is shown the construction of a module structure [2] with universe over a set of a particular kind of mathematical proofs, the base ring of this module will be built on a maximal consistent extension of a set of propositions, this…
Following the analogy between algebras (monoids) and monoidal categories the construction of nucleus for non-associative algebras is simulated on the categorical level. Nuclei of categories of modules are considered as an example.
An F-system is a computational model that performs a folding operation on words of a given language, following directions coded on words of another given language. This paper considers the case in which both given languages are regular, and…
We investigate how various forms of bisimulation can be characterised using the technology of logical relations. The approach taken is that each form of bisimulation corresponds to an algebraic structure derived from a transition system,…
Let $F$ be the category with the set of objects $\bf N$ and morphisms being the functions between the standard finite sets of the corresponding cardinalities. Let $Jf:F\rightarrow Sets$ be the obvious functor from this category to the…
Kleisli bicategories are a natural environment in which the combinatorics involved in various notions of algebraic theory can be handled in a uniform way. The setting allows a clear account of comparisons between such notions. Algebraic…
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…
We develop a purely set-theoretic formalism for binary trees and binary graphs. We define a category of binary automata, and display it as a fibred category over the category of binary graphs. We also relate the notion of binary graphs to…