LCS Technical Memos (1974 - 2003): Recent submissions
Now showing items 322-324 of 486
-
Algebraic Dependencies
(1981-02)We propose a new kind of data dependencies called algebraic dependencies, which generalize all previous known kinds. We give a complete axiomatization of algebraic dependencies in terms of simple algebraic rewriting rules. ... -
The Deducibility Problem in Propositional Dynamic Logic
(1981-02)The problem of whether an arbitrary formula of Propositional Dynamic Logic (PDL) is deducible from a fixed axiom scheme of PDL is _ ]1-complete. Ths contrasts with the decidability of the problem when the axiom scheme is ...


