We prove that any finite set of half-planes can be colored by two colors so that every point of the plane, which belongs to at least three half-planes in the set, is covered by ha...
Barycentric algebras have seen widespread application in the modeling of convex sets, semilattices, and quantum mechanics. Recently, they were developed further to encompass Boolea...
—The fundamental result of linear network coding asserts the existence of optimal codes over acyclic networks when the symbol field is sufficiently large. The restriction to just...
Abstract. aRa is an automatic theorem prover for various kinds of relation algebras. It is based on Gordeev’s Reduction Predicate Calculi for n-variable logic (RPCn) which allow ...
We propose a process algebra obtained by adapting the process algebra with continuous relative timing from Baeten and Middelburg [Process Algebra with Timing, Springer, 2002, Chap....