Related papers: Feasibly Reducing KAT Equations to KA Equations

Abstract interpretation, Hoare logic, and incorrectness (or reverse Hoare) logic are powerful techniques for static analysis of computer programs. All of them have been successfully extended to the quantum setting, but largely developed in…

We prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be derived from the underlying untyped equations. As a consequence, the…

The notion of color algebras is generalized to the class of F-ary algebras, and corresponding decoloration theorems are established. This is used to give a construction of colored structures by means of tensor products with Clifford-like…

We study the problem of matrix Lie algebra conjugacy. Lie algebras arise centrally in areas as diverse as differential equations, particle physics, group theory, and the Mulmuley--Sohoni Geometric Complexity Theory program. A matrix Lie…

Equilibrium logic is an approach to nonmonotonic reasoning that extends the stable-model and answer-set semantics for logic programs. In particular, it includes the general case of nested logic programs, where arbitrary Boolean combinations…

Kleene's computability theory based on his S1-S9 computation schemes constitutes a model for computing with objects of any finite type and extends Turing's `machine model' which formalises computing with real numbers. A fundamental…

Recently, it has been shown how to perform the quantum hamiltonian reduction in the case of general $sl(2)$ embeddings into Lie (super)algebras, and in the case of general $osp(1|2)$ embeddings into Lie superalgebras. In another development…

Reactive programs are ubiquitous in modern applications, and so verification is highly desirable. We present a verification strategy for reactive programs with a large or infinite state space utilising algebraic laws for reactive relations.…

We present a formalization, in the theorem prover Lean, of the classification of solvable Lie algebras of dimension at most three over arbitrary fields. Lie algebras are algebraic objects which encode infinitesimal symmetries, and as such…

Computability logic (CL) (see http://www.cis.upenn.edu/~giorgi/cl.html) is a recently launched program for redeveloping logic as a formal theory of computability, as opposed to the formal theory of truth that logic has more traditionally…

Many combinatorial proofs rely on induction. When these proofs are formulated in traditional language, they can be bulky and unmanageable. Coalgebras provide a language which can reduce reduce many inductive proofs in graded poset theory to…

A finite-dimensional unital and associative algebra over $\mathbb{R}$, or what we shall call simply "an algebra" in this paper for short, generalities the construction by which we derive the complex numbers by "adjoining an element $i$" to…

Traditionally, formal languages are defined as sets of words. More recently, the alternative coalgebraic or coinductive representation as infinite tries, i.e., prefix trees branching over the alphabet, has been used to obtain compact and…

Given a minuscule representation of a simple Lie algebra, we find an algebraic model for the action of a regular element and show that these models can be glued together over the adjoint quotient, viewed as the set of all regular conjugacy…

This research started with an algebra for reasoning about rely/guarantee concurrency for a shared memory model. The approach taken led to a more abstract algebra of atomic steps, in which atomic steps synchronise (rather than interleave)…

In this paper, we define a number of closely related isomorphisms. On one side of these isomorphisms sit a number of of algebras generalizing the Hecke and affine Hecke algebras, which we call the "Hecke family"; on the other, we find…

In topology there is a theorem of Atiyah, concerning K-theory of classifying space of connected compact Lie group. We consider an algebraic analogue of this theorem. We prove that for a split reductive algebraic group G over a field there…

Transition Algebra (TA) is a type of infinite logic introduced to discuss rewriting systems. The natural deductive proof systems already introduced in TA satisfy completeness for countable signatures. However, it lacks compactness, making…

Recursive algebraic data types (term algebras, ADTs) are one of the most well-studied theories in logic, and find application in contexts including functional programming, modelling languages, proof assistants, and verification. At this…

Scaled Boolean algebras are a category of mathematical objects that arose from attempts to understand why the conventional rules of probability should hold when probabilities are construed, not as frequencies or proportions or the like, but…