The paper's main contributions are a compendium of problems that are comple
te for symmetric logarithmic space (SL), a collection of material relating
to SL, a list of open problems, and an extension to the number of problems
known to be SL-complete. Complete problems are one method of studying SL, a
class for which programming is nonintuitive. Our exposition helps make the
class SL less mysterious and more accessible to other researchers.