Vorobyov, Sergei Programming Logics, MPI for Informatics, Max Planck Society;
96-2-008.pdf (Any fulltext), 16MB
Vorobyov, S.(1996). On the decision complexity of the bounded theories of trees (MPI-I-1996-2-008). Saarbrücken: Max-Planck-Institut für Informatik.