Related papers: Feasibly Reducing KAT Equations to KA Equations
We define a new class of pseudo effect algebras, called kite pseudo effect algebras, which is connected with partially ordered groups not necessarily with strong unit. In such a case, starting even with an Abelian po-group, we can obtain a…
This paper proposes appropriate sound and complete proof systems for algebraic structures over metric spaces by combining the development of Quantitative Equational Theories (QET) with the Enriched Lawvere Theories. We extend QETs to Metric…
Boolean-type algebra (BTA) is investigated. A BTA is decomposed into Boolean-type lattice (BTL) and a complementation algebra (CA). When the object set is finite, the matrix expressions of BTL and CA (and then BTA) are presented. The…
We introduce Morita equivalence to the study of Kleene algebras and modules. Classical characterizations of Morita-equivalent semirings such as having equivalent categories of modules and one semiring being a full matrix algebra over the…
Algebraic effects are computational effects that can be described with a set of basic operations and equations between them. As many interesting effect handlers do not respect these equations, most approaches assume a trivial theory,…
We propose a new simplified definition of extended affine Lie algebras (EALAs for short), and also discuss a general version of extended affine Lie algebras, called locally extended affine Lie algebras (LEALAs for short). We prove a…
A Lie algebra $K$ over a field of characteristic zero $E$ is called a completion of a rational Lie algebra $L$, if it contains $L$ as $\mathbb{Q}$-subalgebra and the $E$-span of $L$ is equal to $K$. The class of all completions of a…
We introduce translations between display calculus proofs and labeled calculus proofs in the context of tense logics. First, we show that every derivation in the display calculus for the minimal tense logic Kt extended with general path…
The use of Extended Logics to replace ordinary second order definability in Kleene's {\em Ramified Analytical Hierarchy} is investigated. This mirrors a similar investigation of Kennedy, Magidor and V\"a\"an\"anen \cite{KeMaVa2016} where…
In the context of connections between algebras coming from quantum integrable systems and algebras associated to the orthogonal polynomials of the Askey scheme, we prove that the truncated reflection algebra attached to the Yangian of sl(2)…
We introduce the notion of clone algebra, intended to found a one-sorted, purely algebraic theory of clones. Clone algebras are defined by true identities and thus form a variety in the sense of universal algebra. The most natural clone…
Distributive laws are important for algebraic reasoning in arithmetic and logic. They are equally important for algebraic reasoning about concurrent programs. In existing theories such as Concurrent Kleene Algebra, only partial correctness…
Classical results in computability theory, notably Rice's theorem, focus on the extensional content of programs, namely, on the partial recursive functions that programs compute. Later and more recent work investigated intensional…
We define and study basic properties of *-continuous Kleene $\omega$-algebras that involve a *-continuous Kleene algebra with a *-continuous action on a semimodule and an infinite product operation that is also *-continuous. We show that…
In Monoidal Computer I, we introduced a categorical model of computation where the formal reasoning about computability was supported by the simple and popular diagrammatic language of string diagrams. In the present paper, we refine and…
For any field $\K$ and integer $n\geq 2$ we consider the Leavitt algebra $L_\K(n)$; for any integer $d\geq 1$ we form the matrix ring $S = M_d(L_\K(n))$. $S$ is an associative algebra, but we view $S$ as a Lie algebra using the bracket…
Automata learning is a popular technique for inferring minimal automata through membership and equivalence queries. In this paper, we generalise learning to the theory of coalgebras. The approach relies on the use of logical formulas as…
We introduce the concept of compact quantitative equational theory. A quantitative equational theory is defined to be compact if all its consequences are derivable by means of finite proofs. We prove that the theory of interpolative…
For compact sets $K\subset \mathbb C^{d}$, we introduce a subalgebra $A_{D}(K)$ of $A(K)$, which allows us to obtain Mergelyan type theorems for products of planar compact sets as well as for graphs of functions.
Hoare and He's theory of reactive processes provides a unifying foundation for the formal semantics of concurrent and reactive languages. Though highly applicable, their theory is limited to models that can express event histories as…