Related papers: One-sorted Program Algebras
We investigate the equational theory for Kleene algebra terms with variable complements and constant complements -- (language) complement where it applies only to variables or constants -- w.r.t. languages. While the equational theory…
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 use a way to extend partial combinatory algebras (pcas) by forcing them to represent certain functions. In the case of Scott's Graph model, equality is computable relative to the complement function. However, the converse is not true.…
We investigate the equational theory of Kleene algebra terms with variable complements -- (language) complement where it applies only to variables -- w.r.t. languages. While the equational theory w.r.t. languages coincides with the language…
We provide a new foundational approach to the generalization of terms up to equational theories. We interpret generalization problems in a universal-algebraic setting making a key use of projective and exact algebras in the variety…
We extend the formalisation of confluence results in Kleene algebras to a formalisation of coherent confluence proofs. For this, we introduce the structure of higher globular Kleene algebra, a higher-dimensional generalisation of modal and…
Typestate systems ensure many desirable properties of imperative programs, including initialization of object fields and correct use of stateful library interfaces. Abstract sets with cardinality constraints naturally generalize typestate…
We introduce the notion of a generalized representation of a Jordan algebra with unit. The greneralized representation has the following properties: (1) Usual representations and Jacobson representations correspond to special cases of…
In the present paper, we introduce a multi-type calculus for the logic of measurable Kleene algebras, for which we prove soundness, completeness, conservativity, cut elimination and subformula property. Our proposal imports ideas and…
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…
Applications of algebras in physics are related to the connection of measurable observables to relevant elements of the algebras, usually the generators. However, in the determination of the generators in Lie algebras there is place for…
For the Lie algebra $\g$ of a connected infinite-dimensional Lie group~$G$, there is a natural duality between so-called semi-equicontinuous weak-*-closed convex Ad^*(G)-invariant subsets of the dual space $\g'$ and Ad(G)-invariant lower…
A non-associative algebra over a field $\mathbb{K}$ is a $\mathbb{K}$-vector space $A$ equipped with a bilinear operation \[ {A\times A\to A\colon\; (x,y)\mapsto x\cdot y=xy}. \] The collection of all non-associative algebras over…
We introduce a new framework called linear algebraic number theory (LANT) that reformulates the number-theoretic problem as a regression model and solves it using matrix algebra. This framework restricts all computations to log space,…
This paper contains results from two areas -- formal theory of Kan extensions and concrete categories. The contribution to the former topic is based on the extension of the concept of Kan extension to the cones and we prove that limiting…
Qualification conditions (also termed constraint qualifications) help avoid pathological behavior at domain boundaries in convex analysis. By generalizing facial reduction from conic programming to general convex programs of the form $f(x)…
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…
We generalize Kracht's theory of internal describability from classical modal logic to the family of all logics canonically associated with varieties of normal lattice expansions (LE algebras). We work in the purely algebraic setting of…
We introduce an algebra $\mathcal{K}_n$ which has a structure of a left comodule over the quantum toroidal algebra of type $A_{n-1}$. Algebra $\mathcal{K}_n$ is a higher rank generalization of $\mathcal{K}_1$, which provides a uniform…
Computerized Adaptive Testing (CAT) measures an examinee's ability while adapting to their level. Both too many questions and too many hard questions can make a test frustrating. Are there some CAT algorithms which can be proven to be…