Abstract
A lower bound of ?(n/logn) space is shown for two natural proof systems for equational logic. The method introduces an edging game, a generalization of the pebble game [P].
Cite
CITATION STYLE
APA
Kozen, D. (1984). Pebblings, edgings, and equational logic. In Proceedings of the Annual ACM Symposium on Theory of Computing (pp. 428–435). Association for Computing Machinery. https://doi.org/10.1145/800057.808709
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free