Pebblings, Edgings, and Equational Logic
A lower bound of Ω(<italic>n/logn</italic>) space is shown for two natural proof systems for equational logic. The method introduces an <italic>edging game,</italic> a generalization of the pebble game [P].