Under the auspices of the Computational Complexity Foundation (CCF)
We present a Logspace, many-one reduction from the undirected st-connectivity problem to its complement. This shows that $SL=co-SL$