Information and Computation , to appear. The geometry of optimal lambda reduction. 1992 POPL Conference. Gerd Hillebrand, Paris Kanellakis, Harry Mairson, and Moshe Vardi. Undecidable boundedness problems for database logic programs.
Nondeterministic space is closed under complementation.
From proof nets to interaction nets. A simple proof of a theorem of Statman. Constructivity in Computer Science Symposium. Intuitionistic propositional logic is polynomial-space complete.