2000 character limit reached
Hypothesis Elimination in Kleene Semirings
Published 12 Mar 2014 in cs.LO | (1403.4074v1)
Abstract: A Kleene semiring is an algebraic structure satisfying the axioms of Kleene algebra, minus the annihilation axioms (x.0 = 0 = 0.x). We show that Kleene semirings (like Kleene algebras) admit the efficient elimination of various kinds of equational hypotheses, in particular Hoare formulas (t=0, where t is an arbitrary term). Our method is purely proof-theoretic, and can be used to eliminate Horn hypotheses in any suitable Horn-equational theory. Moreover, it gives a simple condition under which hypotheses eliminations can be combined.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.