A decidability result about sufficient-completeness of axiomatically specified abstract data types

Tobias Nipkow, Gerhard Weikum. A decidability result about sufficient-completeness of axiomatically specified abstract data types. In Armin B. Cremers, Hans-Peter Kriegel, editors, Theoretical Computer Science, 6th GI-Conference, Dortmund, Germany, January 5-7, 1983, Proceedings. Volume 145 of Lecture Notes in Computer Science, pages 257-268, Springer, 1983.

Abstract

Abstract is missing.