Related papers: Hypothesis Elimination in Kleene Semirings

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…

We prove a desingularization theorem for the quasi-smooth derived scheme, in the sense of Hekking. We also propose the conjecture that the K-theoretic integration of the virtual fundamental class of a quasi-smooth derived scheme could be…

Guarded Kleene Algebra with Tests (GKAT for short) is an efficient fragment of Kleene Algebra with Tests, suitable for reasoning about simple imperative while-programs. Following earlier work by Das and Pous on Kleene Algebra, we study GKAT…

A provenance analysis for a query evaluation or a model checking computation extracts information on how its result depends on the atomic facts of the model or database. Traditional work on data provenance was, to a large extent, restricted…

In the framework of the four-dimensional effective theory of heterotic superstrings at low energies, which is considered as a generalised theory of gravity, we search for new black hole solutions. The analytical expressions of all the…

To what extent are all astrophysical, dark, compact objects both black holes (BHs) and described by the Kerr geometry? We embark on the exercise of defying the universality of this remarkable idea, often called the "Kerr hypothesis". After…

Question 3 of [3] asks whether the matrix ring Mn(R) is nil clean, for any nil clean ring R. It is shown that positive answer to this question is equivalent to positive solution for Kothe's problem in the class of algebras over the field…

This booklet serves as an introduction to Kleene Algebra (KA), a set of laws that can be used to study general equivalences between programs. It discusses how general programs can be modeled using regular expressions, how those expressions…

Logic programming has developed as a rich field, built over a logical substratum whose main constituent is a nonclassical form of negation, sometimes coexisting with classical negation. The field has seen the advent of a number of…

Let $\0$ be a nilpotent orbit in a semisimple complex Lie algebra $\g$. Denote by $G$ the simply connected Lie group with Lie algebra $\g$. For a $G$-homogeneous covering $M \to \0$, let $X$ be the normalization of $\bar{\0}$ in the…

The classical Hermite-Biehler theorem describes possible zero sets of complex linear combinations of two real polynomials whose zeros strictly interlace. We provide the full characterization of zero sets for the case when this interlacing…

We introduce a version of probabilistic Kleene algebra with angelic nondeterminism and a corresponding class of automata. Our approach implements semantics via distributions over multisets in order to overcome theoretical barriers arising…

We use standard constructions in algebraic geometry and homological algebra to extend the decomposition and hard Lefschetz theorems of T. Mochizuki and C. Sabbah so that they remains valid without the quasi-projectivity assumptions.

We study generalized fixed-point equations over idempotent semirings and provide an efficient algorithm for the detection whether a sequence of Kleene's iterations stabilizes after a finite number of steps. Previously known approaches…

In the second section, we introduce hemiring-valued pseudonormed rings and generalize Albert's result which states that every finite-dimensional algebra can be normed. Next, we introduce shrinkable hemirings and prove that dense division…

Synchronous Kleene algebra (SKA), an extension of Kleene algebra (KA), was proposed by Prisacariu as a tool for reasoning about programs that may execute synchronously, i.e., in lock-step. We provide a countermodel witnessing that the…

Guarded Kleene Algebra with Tests (GKAT) is an efficient fragment of KAT, as it allows for almost linear decidability of equivalence. In this paper, we study the (co)algebraic properties of GKAT. Our initial focus is on the fragment that…

Let K be an Abstract Elementary Class. Under the asusmptions that K has a nicely behaved forking-like notion, regular types and existence of some prime models we establish a decomposition theorem for such classes. The decomposition implies…

We propose a new approach to formally describing the requirement for statistical inference and checking whether a program uses the statistical method appropriately. Specifically, we define belief Hoare logic (BHL) for formalizing and…

Kleene algebra with tests (KAT) is an algebraic framework for reasoning about the control flow of sequential programs. Generalising KAT to reason about concurrent programs is not straightforward, because axioms native to KAT in conjunction…