DUALITY THEOREMS AND THEOREMS OF THE ALTERNATIVE.MCLINDEN L.1975; PROC. AMER. MATH. SOC.; U.S.A.; DA. 1975; VOL. 53; NO 1; PP. 172-175; BIBL. 6 REF.Article

DECIDABILITE PAR AUTOMATE FINIHODGSON BR.1983; ANNALES DES SCIENCES MATHEMATIQUES DU QUEBEC; ISSN 0707-9109; CAN; DA. 1983; VOL. 7; NO 1; PP. 39-57; BIBL. 21 REF.Article

REPRESENTATION OF ONE-ONE DEGREES BY DECISION PROBLEMS FOR SYSTEM FUNCTIONSTHURAISINGHAM MB.1982; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1982; VOL. 24; NO 3; PP. 373-377; BIBL. 8 REF.Article

UNDECIDABLE THEORIES IN STATIONARY LOGICSEESE D; TUSCHIK P; WEESE M et al.1982; PROC. AM. MATH. SOC.; ISSN 0002-9939; USA; DA. 1982; VOL. 84; NO 4; PP. 563-567; BIBL. 7 REF.Article

COMPLEXITE ALGORITHMIQUE DE LA THEORIE DE DEUX BIJECTIONS QUI COMMUTENT = ALGORITHMIC COMPLEXITY OF THE THEORY OF TWO COMMUTING BIJECTIONSPELZ ELIZABETH.1982; ; FRA; DA. 1982; 48 P.; 30 CM; BIBL. 1 P.; TH. 3E CYCLE: MATH./PARIS 7/1982Thesis

SUR LA DETERMINATION DU RANG D'UNE EQUATION DANS LE MONOIDE LIBREPECUCHET JP.1981; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1981; VOL. 16; NO 3; PP. 337-340; BIBL. 4 REF.Article

ABSOLUTE PRIMALITY OF POLYNOMIALS IS DECIDABLE IN RANDOM POLYNOMIAL TIME IN THE NUMBER OF VARIABLESHEINTZ J; SIEVEKING M.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 115; PP. 16-28; BIBL. 10 REF.Conference Paper

DECIDABILITY FOR BRANCHING TIMEBURGESS JP.1980; STUD. LOGICA; POL; DA. 1980; VOL. 39; NO 2-3; PP. 203-218; BIBL. 3 REF.Article

DECISION COMPLEXICITY OF VARIANTS OF PROPOSITIONAL DYNAMIC LOGICVALIEV MK.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; VOL. 88; PP. 656-664; BIBL. 10 REF.Conference Paper

GENERALIZED HAERTIG QUANTIFIERSHAUSCHILD K.1980; BULL. ACAD. POL. SCI., SCI. MATH.; POL; DA. 1980; VOL. 28; NO 11-12; PP. 523-528; ABS. RUS; BIBL. 5 REF.Article

ON THE ELEMENTARY THEORY OF QUADRUPLES OF VECTOR SPACESBAUR W.1980; ANN. MATH. LOGIC; ISSN 0003-4843; NLD; DA. 1980; VOL. 19; NO 3; PP. 243-262; BIBL. 7 REF.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

DOMAIN RESTRICTIONS IN STANDARD DEDUCTIVE LOGICSWIGGART P.1979; NOTRE DAME J. FORM. LOGIC; USA; DA. 1979; VOL. 20; NO 1; PP. 115-129; BIBL. 13 REF.Article

SENTENCES WITH THREE QUANTIFIERS ARE DECIDABLE IN SET THEORYGOGOL D.1979; FUNDAM. MATH.; POL; DA. 1979; VOL. 102; NO 1; PP. 1-8; BIBL. 1 REF.Article

THEORIES WITH RECURSIVE MODELSLERMAN M; SCHMERL JH.1979; J. SYMBOL. LOGIC; USA; DA. 1979; VOL. 44; NO 1; PP. 59-76; BIBL. 10 REF.Article

AN UNDECIDABILITY RESULT FOR RELATION ALGEBRASSCHOENFELD W.1979; J. SYMBOL. LOGIC; USA; DA. 1979; VOL. 44; NO 1; PP. 111-115; BIBL. 7 REF.Article

DECIDABLE THEORIES.RABIN MO.1977; STUD. LOGIC FOUND. MATH.; NETHERL.; DA. 1977; VOL. 90; PP. 595-629; BIBL. 1 P. 1/2Article

CLOSEDNESS PROPERTIES AND DECISION PROBLEMS FOR FINITE MULTI-TAPE AUTOMATA.STARKE PH.1976; KYBERNETIKA; CESKOSL.; DA. 1976; VOL. 12; NO 2; PP. 61-75; BIBL. 10 REF.Article

THE DECIDABILITY OF SOME %₀-CATEGORICAL THEORIES.SCHMERL JH.1976; COLLOQ. MATH.; POLOGNE; DA. 1976; VOL. 36; NO 2; PP. 165-169; BIBL. 5 REF.Article

THE DECISION PROBLEM FOR STANDARD CLASSES.GUREVICH Y.1976; J. SYMBOL. LOGIC; U.S.A.; DA. 1976; VOL. 41; NO 2; PP. 460-464; BIBL. 8 REF.Article

DIE RELATIONALE AQUIVALENZ VON AUTAMATEN. = L'EQUIVALENCE RELATIONNELLE DES AUTOMATESWALTER HKG.1976; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1976; VOL. 12; NO 3; PP. 123-131; ABS. ANGL. RUSSE; BIBL. 10 REF.Article

ZUR ENTSCHEIDBARKEIT DER MONADISCHEN THEORIE 2. STUFE BAUMARTIGER GRAPHEN. = SUR LA DECIDABILITE DE LA THEORIE MONADIQUE DE DEUXIEME ORDRE DES QUASI-ARBRESSEESE DG.1975; WISSENSCH. Z. HUMBOLDT-UNIV. BERLIN, MATH.-NATURWISSENSCH. REIHE; DTSCH.; DA. 1975; VOL. 24; NO 6; PP. 768-772; ABS. RUSSE ANGL. FR.; BIBL. 24 REF.Article

THE MONADIC SECOND ORDER THEORY OF ALL COUNTABLE ORDINALSBUCHI JR; SIEFKES D.1973; LECTURE NOTES MATH.; GERM.; DA. 1973; NO 328; PP. 1-217; BIBL. 2 P.1/2Serial Issue

INDISCERNIBLES AND DECIDABLE MODELSKIERSTEAD HA; REMMEL JB.1983; JOURNAL OF SYMBOLIC LOGIC; ISSN 0022-4812; USA; DA. 1983; VOL. 48; NO 1; PP. 21-32; BIBL. 7 REF.Article

PERSISTENTLY FINITE THEORIES WITH HYPERARITHMETIC MODELSMILLAR T.1983; TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY; ISSN 0002-9947; USA; DA. 1983; VOL. 278; NO 1; PP. 91-99; BIBL. 4 REF.Article