Related papers: Hypothesis Elimination in Kleene Semirings
In the theory of commutative semirings, the lack of additive inverses creates a structural divergence between ideals and congruences that does not exist in ring theory. The aim of this article is to restore critical ideal-theoretic…
We investigate ideal-semisimple and congruence-semisimple semirings. We give several new characterizations of such semirings using e-projective and e-injective semimodules. We extend several characterizations of semisimple rings to (not…
Goldie's Theorem (1960), which is one of the most important results in Ring Theory, is a criterion for a ring to have a semisimple left quotient ring. The aim of the paper is to give four new criteria (using a completely different approach…
We numerically integrate the semiclassical equations of motion for spherically symmetric Einstein-Maxwell theory with a dilaton coupled scalar field and look for zero temperature configurations. The solution we find is studied in detail…
Local Completeness Logic (LCL) has been put forward as a program logic for proving both the correctness and incorrectness of program specifications. LCL is an abstract logic, parameterized by an abstract domain that allows combining over-…
Automata operating on pairs of words were introduced as an alternative way of capturing acceptance of regular $\omega$-languages. Families of DFAs and lasso automata operating on such pairs followed, giving rise to minimisation algorithms,…
We introduce Kleene-Varlet spaces as partially ordered sets equipped with a polarity satisfying certain additional conditions. By applying Kleene-Varlet spaces, we prove that each regular pseudocomplemented Kleene algebra is isomorphic to a…
Toric (or sparse) elimination theory is a framework developped during the last decades to exploit monomial structures in systems of Laurent polynomials. Roughly speaking, this amounts to computing in a \emph{semigroup algebra}, \emph{i.e.}…
In this paper, we study the Andr\'e-Quillen homology of simplicial commutative $\ell$-algebras, $\ell$ a field, having certain vanishing properties. When $\ell$ has non-zero characteristic, we obtain an algebraic version of a theorem of…
We investigate the relationship between coseparable and semisimple corings. In particular we prove that a coring over a separable algebra is coseparable if and only if it is absolutely semisimple.
We propose a generalisation of concurrent Kleene algebra \cite{Hoa09} that can take account of probabilistic effects in the presence of concurrency. The algebra is proved sound with respect to a model of automata modulo a variant of rooted…
Hyperfields and systems are two algebraic frameworks which have been developed to provide a unified approach to classical and tropical structures. All hyperfields, and more generally hyperrings, can be represented by systems. Conversely, we…
We first propose algorithms for checking language equivalence of finite automata over a large alphabet. We use symbolic automata, where the transition function is compactly represented using a (multi-terminal) binary decision diagrams…
The main purpose of this paper is to investigate the zero-divisors of semigroups with zero and semirings and in particular, to discuss eversible and reversible semigroups and semirings. We also introduce a new ring-like algebraic structure…
We introduce the two substructural propositional logics KL, KL+, which use disjunction, fusion and a unary, (quasi-)exponential connective. For both we prove strong completeness with respect to the interpretation in Kleene algebras and a…
We classify the two-way independence quasi-independence models (or independence models with structural zeros) that have rational maximum likelihood estimators, or MLEs. We give a necessary and sufficient condition on the bipartite graph…
We extend the definition and study the algebraic properties of the polylogarithm Li(T), where T is rational series over the alphabet X = {x 0, x 1} belonging to suitable subalgebras of rational series.
Semifields are semirings in which every nonzero element has a multiplicative inverse. A rough classification uses the characteristic of the semifield, that is the isomorphism type of the semifield generated by the two neutral elements. For…
We exhibit a uniform method for obtaining (wellfounded and non-wellfounded) cut-free sequent-style proof systems that are sound and complete for various classes of action algebras, i.e., Kleene algebras enriched with meets and residuals.…
Concurrent Kleene Algebra (CKA) was introduced by Hoare, Moeller, Struth and Wehrman in 2009 as a framework to reason about concurrent programs. We prove that the axioms for CKA with bounded parallelism are complete for the semantics…