Showing papers in "Theoretical Computer Science in 1974"

TL;DR: The "mu-calculus" is a formal system which arises fairly naturally when one tries to extend predicate logic to formalise arguments about programs.

TL;DR: Any computation of Boolean matrix product by an acyclic network using only the operations of binary conjunction and disjunction requires at least IJK conjunctions and IJ(K-1) disjunctions for the product of matrices of sizes I x K and K x J.

TL;DR: It is shown, that Ashenhurst decomposition of switching functions does not always yield optimal circuits and a new result concerning the trade-off between circuit size and monotone circuit size is proved.