We present a complete axiomatization of test algebra ( 24, 18, 29]), the two-sorted algebraic variant of Propositional Dynamic Logic (PDL, 21, 7]). The axiomatization consists of ...
This paper deals with test case selection from axiomatic specifications whose axioms are quantifier-free first-order formulas with equality. We first prove the existence of an ide...
PCF, as considered in this paper, is a lazy typed lambda calculus with functions, pairing, fixed-point operators and arbitrary algebraic data types. The natural equational axioms ...
We give an axiomatic treatment of fixed-point operators in categories. A notion of iteration operator is defined, embodying the equational properties of iteration theories. We p...
Abstract. We use coalgebraic methods to describe finitely generated free Heyting algebras. Heyting algebras are axiomatized by rank 0-1 axioms. In the process of constructing free...