English
Related papers

Related papers: Hypothesis Elimination in Kleene Semirings

200 papers

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…

Logic · Mathematics 2024-12-23 Arthur Azevedo de Amorim , Cheng Zhang , Marco Gaboardi

We present a reflexive tactic for deciding the equational theory of Kleene algebras in the Coq proof assistant. This tactic relies on a careful implementation of efficient finite automata algorithms, so that it solves casual equations…

Logic in Computer Science · Computer Science 2015-07-01 Thomas Braibant , Damien Pous

Convolution algebras on maps from structures such as monoids, groups or categories into semirings, rings or fields abound in mathematics and the sciences. Of special interest in computing are convolution algebras based on variants of Kleene…

Formal Languages and Automata Theory · Computer Science 2026-02-27 James Cranch , Georg Struth , Jana Wagemaker

In this paper, among other results, there are described (complete) simple - simultaneously ideal- and congruence-simple - endomorphism semirings of (complete) idempotent commutative monoids; it is shown that the concepts of simpleness,…

Rings and Algebras · Mathematics 2011-05-30 Yefim Katsov , Tran Giang Nam , Jens Zumbrägel

We show that finite-dimensional Lie algebras over a field of characteristic zero such that the second cohomology group in every finite-dimensional module vanishes, are, essentially, semisimple.

Rings and Algebras · Mathematics 2014-08-14 Pasha Zusmanovich

Let $M$ be a symplectic manifold, equipped with a Hamiltonian action of a torus $T$. We give an explicit formula for the rational cohomology ring of the symplectic quotient $M//T$ in terms of the cohomology ring of $M$ and fixed point data.…

Differential Geometry · Mathematics 2007-05-23 Susan Tolman , Jonathan Weitsman

The general completeness problem of Hoare logic relative to the standard model $N$ of Peano arithmetic has been studied by Cook, and it allows for the use of arbitrary arithmetical formulas as assertions. In practice, the assertions would…

Logic in Computer Science · Computer Science 2017-03-02 Zhaowei Xu , Wenhui Zhang , Yuefei Sui

A small change of basis in k.p theory yields a Kane-like Hamiltonian for the conduction and valence bands of narrow-gap semiconductors that has no spurious solutions, yet provides an accurate fit to all effective masses. The theory is shown…

Materials Science · Physics 2007-07-02 Bradley A. Foreman

Kleene algebra with tests (KAT) was introduced as an algebraic structure to model and reason about classic imperative programs, i.e. sequences of discrete transitions guarded by Boolean tests. This paper introduces two generalisations of…

Logic in Computer Science · Computer Science 2019-11-05 Leandro Gomes , Alexandre Madeira , Luís Soares Barbosa

We consider a general Einstein-scalar-GB theory with a coupling function f(\phi). We demonstrate that black-hole solutions appear as a generic feature of this theory since a regular horizon and an asymptotically-flat solution may be easily…

High Energy Physics - Theory · Physics 2018-04-04 G. Antoniou , A. Bakopoulos , P. Kanti

We show that the deletion theorem of a free arrangement is combinatorial, i.e., whether we can delete a hyperplane from a free arrangement keeping freeness depends only on the intersection lattice. In fact, we give an explicit sufficient…

Combinatorics · Mathematics 2017-09-26 Takuro Abe

In relational verification, judicious alignment of computational steps facilitates proof of relations between programs using simple relational assertions. Relational Hoare logics (RHL) provide compositional rules that embody various…

Logic in Computer Science · Computer Science 2025-11-12 Ramana Nagasamudram , Anindya Banerjee , David A. Naumann

Given a first-order sentence, a model-checking computation tests whether the sentence holds true in a given finite structure. Data provenance extracts from this computation an abstraction of the manner in which its result depends on the…

Logic in Computer Science · Computer Science 2017-12-07 Erich Grädel , Val Tannen

We investigate the notion of \textit{semi-nil clean} rings, defined as those rings in which each element can be expressed as a sum of a periodic and a nilpotent element. Among our results, we show that if $R$ is a semi-nil clean NI ring,…

Rings and Algebras · Mathematics 2024-09-04 M. H. Bien , P. V. Danchev , M. Ramezan-Nassab

We show that any regular pseudocomplemented Kleene algebra defined on an algebraic lattice is isomorphic to a rough set Kleene algebra determined by a tolerance induced by an irredundant covering.

Combinatorics · Mathematics 2019-04-18 Jouni Järvinen , Sándor Radeleczki

It is shown that the classification theorems for semisimple algebraic groups in characteristic zero can be derived quite simply and naturally from the corresponding theorems for Lie algebras by using a little of the theory of tensor…

Representation Theory · Mathematics 2007-05-23 J. S. Milne

{Generalizing the notion of nil cleanness from \cite{D13}, in parallel to \cite{DM14}, we define the concept of {\it weak nil cleanness} for an arbitrary ring. Its comprehensive study in different ways is provided as well. A decomposition…

Rings and Algebras · Mathematics 2014-12-18 Simion Breaz , Peter Danchev , Yiqiang Zhou

In the present paper we develop a small cancellation theory for associative algebras with a basis of invertible elements. Namely, we study quotients of a group algebra of a free group and introduce three axioms for the corresponding…

Rings and Algebras · Mathematics 2024-01-17 A. Atkarskaya , A. Kanel-Belov , E. Plotkin , E. Rips

We prove that every quasi-projective semi log canonical pair has a quasi-log structure with several good properties. It implies that various vanishing theorems, torsion-free theorem, and the cone and contraction theorem hold for semi log…

Algebraic Geometry · Mathematics 2013-10-29 Osamu Fujino

In this work we prove the undecidability (and $\Sigma^0_1$-completeness) of several theories of semirings with fixed points. The generality of our results stems from recursion theoretic methods, namely the technique of effective…

Logic · Mathematics 2025-12-23 Anupam Das , Abhishek De , Stepan L. Kuznetsov