Max-Flow Min-Cut Theorems for Communication Networks Based on Equational Logic