We give a new, significantly shorter proof of the completeness of the left-handed star rule of Kleene algebra. The proof reveals the rich interaction of algebra and coalgebra in the theory.

Left-sequential logics provide a means for reasoning about (closed) propositional terms with atomic propositions that may have side effects and that are evaluated sequentially from left to right. Such propositional terms are commonly used in programming languages to direct the flow of a program. In this thesis we explore two such left-sequential logics. First we discuss Fully Evaluated Left-Seq...

In this paper, we give a kind of Cauchy 1-completeness in probabilistic quasi-uniform spaces by using 1-filters. Utilizingthe relationships among probabilistic quasi-uniformities, classical quasi-uniformities and Hutton [0, 1]-quasi-uniformities,we show the relationships between their completeness. In fuzzy quasi-metric spaces, we establish the relationshipsbetween the completeness of induced p...

A term rewriting system is called complete if it is both confluent and strongly normalising. Barendregt and Klop showed that the disjoint union of complete term rewriting systems does not need to be complete. In other words, completeness is not a modular property of term rewriting systems. Toyama, Klop and Barendregt showed that completeness is a modular property of left-linear term rewriting s...

Recently the question of standard completeness of MTL and its extensions were deeply studied. Jenei and Montagna showed that MTL logic satisfies standard completeness theorem (see [6]). In [2], the authors studied standard completeness of ΠMTL which is an axiomatic extension of MTL logic where the conjunction is interpreted by a left-continuous cancellative t-norm. They showed that ΠMTL logic i...