A NEW GENERAL APPROACH TO THE THEORY OF THE MANY-ONE EQUIVALENCE OF DECISION PROBLEMS FOR ALGORITHMIC SYSTEMSBOERGER E.1979; Z. MATH. LOGIK GRUNDL. MATH.; DDR; DA. 1979; VOL. 25; NO 2; PP. 135-162; BIBL. 72 REF.Article

LOGICAL DESCRIPTION OF COMPUTATION PROCESSESBOERGER E.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 117; PP. 410-424; BIBL. 14 REF.Conference Paper

EIN EINFACHER BEWEIS FUER DIE UNENTSCHEIDBARKEIT DER KLASSISCHEN PRAEDIKATENLOGIK = UNE DEMONSTRATION SIMPLE POUR L'INDECIDABILITE DE LA LOGIQUE DES PREDICATS CLASSIQUEBOERGER E.1978; MATH.-PHYS. SEMESTERBER.; DEU; DA. 1978; VOL. 25; NO 2; PP. 290-299; BIBL. 1 P.Article

THE R.E. COMPLEXITY OF DECISION PROBLEMS FOR COMMUTATIVE SEMI-THUE SYSTEMS WITH RECURSIVE RULE SETBOERGER E; BUENING HK.1980; Z. MATH. LOGIK GRUNDL. MATH.; ISSN 0044-3050; DDR; DA. 1980; VOL. 26; NO 5; PP. 459-469; BIBL. 9 REF.Article

THE EQUIVALENCE OF HORN AND NETWORK COMPLEXITY FOR BOOLEAN FUNCTIONSANDERAA SO; BOERGER E.1981; ACTA INF.; ISSN 0001-5903; DEU; DA. 1981; VOL. 15; NO 3; PP. 303-307; BIBL. 9 REF.Article