Related papers: One-sorted Program Algebras
Let $F$ be an incompressible, meridionally incompressible and not boundary-parallel surface with boundary in the complement of an algebraic tangle $(B,T)$. Then $F$ separates the strings of $T$ in $B$ and the boundary slope of $F$ is…
In this paper we present a detailed proof of an important result of algebraic logic: namely that the free commutative Kleene algebra is the space of semilinear sets. The first proof of this result was proposed by Redko in 1964, and…
We completely classify Cartan subalgebras of dimension drop algebras with coprime parameters. More generally, we classify Cartan subalgebras of arbitrary stabilised dimension drop algebras that are non-degenerate in the sense that the…
We propose a generalization of first-order logic originating in a neglected work by C.C. Chang: a natural and generic correspondence language for any types of structures which can be recast as Set-coalgebras. We discuss axiomatization and…
This paper studies the expressive and computational power of discrete Ordinary Differential Equations (ODEs), a.k.a. (Ordinary) Difference Equations. It presents a new framework using these equations as a central tool for computation and…
Let $K$ be any field, let $L_n$ denote the Leavitt algebra of type $(1,n-1)$ having coefficients in $K$, and let ${\rm M}_d(L_n)$ denote the ring of $d \times d$ matrices over $L_n$. In our main result, we show that ${\rm M}_d(L_n) \cong…
Concrete domains, especially those that allow to compare features with numeric values, have long been recognized as a very desirable extension of description logics (DLs), and significant efforts have been invested into adding them to usual…
For a proper cone $K$ and its dual cone $K^*$ in $\mathbb R^n$, the complementarity set of $K$ is defined as ${\mathbb C}(K)=\{(x,y): x\in K,\; y\in K^*,\, x^\top y=0\}$. It is known that ${\mathbb C}(K)$ is an $n$-dimensional manifold in…
We investigate a class of combinatory algebras, called ribbon combinatory algebras, in which we can interpret both the braided untyped linear lambda calculus and framed oriented tangles. Any reflexive object in a ribbon category gives rise…
In this short note we relate some known properties of propositional calculus to purely algebraic considerations of a Boolean algebra. Classes of formulas of propositional calculus are considered as elements of a Boolean algebra. As such…
We consider algebras of languages over the signature of reversible Kleene lattices, that is the regular operations (empty and unit languages, union, concatenation and Kleene star) together with intersection and mirror image. We provide a…
Given a 2-category $\twocat{K}$ admitting a calculus of bimodules, and a 2-monad T on it compatible with such calculus, we construct a 2-category $\twocat{L}$ with a 2-monad S on it such that: (1)S has the adjoint-pseudo-algebra property.…
The paper is devoted to the implicit function theorem involving singular mappings.We also discuss the form of the tangent cone to the solution set of the generalized equations in singular case and give some examples of applications to…
This paper presents a canonical duality theory for solving a general nonconvex constrained optimization problem within a unified framework to cover Lagrange multiplier method and KKT theory. It is proved that if both target function and…
The KAK decomposition is a fundamental tool in Lie theory and quantum computing. Despite its widespread use, the mathematical foundations remain incomplete, particularly regarding the precise conditions for the decomposition and the…
If $L$ is a semisimple Lie algebra of vector fields on R^N with a split Cartan subalgebra C, then it is proved that the dimension of the generic orbit of C coincides with the dimension of C. As a consequence one obtains a local canonical…
We prove that the equational theory of Kleene algebra with commutativity conditions on primitives (or atomic terms) is undecidable, thereby settling a longstanding open question in the theory of Kleene algebra. While this question has also…
Turing's famous 'machine' model constitutes the first intuitively convincing framework for computing with real numbers. Kleene's computation schemes S1-S9 extend Turing's approach and provide a framework for computing with objects of any…
We unify Linear Algebra by proposing a definition of determinants via one equation that implies all known properties of them:\\ 1. Cramer's Rule,\\ 2. Cofactor expansion,\\ 3. Antisymmetry of determinants,\\ 4. Linearity of determinants,\\…
We exhibit an adjunction between a category of abstract algebras of partial functions and a category of set quotients. The algebras are those atomic algebras representable as a collection of partial functions closed under relative…