ON GENERALIZED BOOLEAN FUNCTIONS ITANDAREANU N.1981; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1981; VOL. 34; NO 3; PP. 293-299; BIBL. 2 REF.Article

MANAGEMENT INFORMATION SYSTEMS STRUCTURE TYPES AND INTEGRATIONBARROS O.1981; INFORMATION SYSTEMS; ISSN 0306-4379; GBR; DA. 1981; VOL. 6; NO 4; PP. 243-254; BIBL. 28 REF.Article

LOGISCHE FUNKTIONEN IM RAHMEN DER FASTLEGUNG LOGISCHER WIRKZUSAMMENHAENGE KOMPLEXER TECHNISCHER SYSTEME = FONCTIONS LOGIQUES DANS LE CADRE DE L'ETABLISSEMENT DE RELATIONS OPERATOIRES LOGIQUES DANS LES SYSTEMES TECHNIQUES COMPLEXESBAUMANN HG; LOOSCHELDERS KH; VON WYL H et al.1979; ARCH. EISENHUETTENWES.; DEU; DA. 1979; VOL. 50; NO 3; PP. 117-122; ABS. ENG/FRE; BIBL. 3 REF.Article

AN ALGEBRAIC APPROACH TO THE COMPOSITION OF MULTI-VALUED LOGICAL FUNCTIONS.FUJITA Y; NISHIDA F.1977; BULL. UNIV. OSAKA PREFECT., A; JAP.; DA. 1977; VOL. 26; NO 1; PP. 1-12; BIBL. 5 REF.Article

ON THE FIXING GROUP FOR A TOTALLY PRE-ORDERED BOOLEAN FUNCTIONUEDA T.1979; DISCRETE MATH.; NLD; DA. 1979; VOL. 26; NO 3; PP. 293-295; BIBL. 6 REF.Article

A COMPLETENESS CRITERION FOR SPECTRA.HIKITA T; NOZAKI A.1977; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1977; VOL. 6; NO 2; PP. 285-297; BIBL. 11 REF.Article

ON THE SETS OF MINIMAL INDICES OF PARTIAL RECURSIVE FUNCTIONSMARANDZJAN GB.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; VOL. 74; PP. 372-374; BIBL. 3 REF.Conference Paper

PREDICATS SUR LES ENSEMBLES. 1ERE COMMUNICATIONSARNAVSKIJ NG; POSLAVSKIJ SA.1979; PROBL. BIONIKI; UKR; DA. 1979; NO 22; PP. 81-87; BIBL. 2 REF.Article

CLASSIFICATION OF EXCLUSIVE-OR STRUCTURES IN THE MINIMIZATION OF LOGIC FUNCTIONSKARTALOPOULOS SV.1980; INT. J. ELECTRON. THEOR. EXP.; ISSN 0020-7217; GBR; DA. 1980; VOL. 49; NO 2; PP. 115-129; BIBL. 10 REF.Article

ON THE NUMBER OF AFFINE FAMILIES OF BOOLEAN FUNCTIONSBALAKRISHNAN KRISHNAMURTHY; MOLL RN.1979; INFORM. AND CONTROL; USA; DA. 1979; VOL. 43; NO 3; PP. 327-337; BIBL. 6 REF.Article

SIZE DEPTH TRADEOFF IN BOOLEAN FORMULES.COMMENTZ WALTER B.1978; LECTURE NOTES COMPUTER SCI.; GERM.; DA. 1978; NO 62; PP. 125-141; BIBL. 19 REF.; (AUTOM. LANG. PROGRAM. COLLOQ. 5; UDINE; 1978)Conference Paper

BOUNDS ON THE NUMBER OF FUZZY FUNCTIONS.KAMEDA T; SADEH E.1977; INFORM. AND CONTROL; U.S.A.; DA. 1977; VOL. 35; NO 2; PP. 139-145; BIBL. 6 REF.Article

AN ALGORITHM FOR TRANSFORMATION OF AN ARBITRARY SWITCHING FUNCTION TO A COMPLETELY SYMMETRIC FUNCTION.LEE DT; SE JUNE HONG.1976; I.E.E.E. TRANS. COMPUTERS; U.S.A.; DA. 1976; VOL. 25; NO 11; PP. 1117-1123; BIBL. 8 REF.Article

THE DEPTH OF FUNCTIONS IN M-VALUED LOGICHENNO J.1979; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DDR; DA. 1979; VOL. 15; NO 1-2; PP. 33-36; ABS. GER/RUS; BIBL. 7 REF.Article

CLASSES FERMEES DE FONCTIONS AUTODUALES DE LA LOGIQUE MULTIVALENTEMARCHENKOV SS.1979; PROBL. KIBERN.; SUN; DA. 1979; NO 36; PP. 5-22; BIBL. 4 REF.Article

MINIMALIZACJA WIELVARGUMENTOWYCH FUNKCJI LOGICZNYCH STABO OKRESLONYCH Z WIAZANIAMI WIELVARGUMENTOWYMI = MINIMISATION DE FONCTIONS LOGIQUES FAIBLEMENT DEFINIES A ARGUMENTS MULTIPLES AVEC DES LIAISONS A ARGUMENTS MULTIPLESDUDEK W.1979; ARCH. AUTOMAT. TELEMECH.; POL; DA. 1979; VOL. 24; NO 1; PP. 123-134; ABS. RUS/ENG; BIBL. 10 REF.Article

KARNAUGH MAP EXTENDED TO SIX OR MORE VARIABLESHALDER AK.1982; ELECTRONICS LETTERS; ISSN 0013-5194; GBR; DA. 1982; VOL. 18; NO 20; PP. 868-870; BIBL. 4 REF.Article

ALGEBRE DE BOOLEBLANCHARD M.1982; TECHNIQUES DE L'INGENIEUR, MESURES ET CONTROLE; FRA; PARIS: TECH. ING.; DA. 1982; NO 77; R 7050; 8 P.; BIBL. 6 REF.Book Chapter

CONSTRUCTION DES CIRCUITS DE PROFONDEUR MINIMALE, REALISANT LA CONJONCTION DANS LA BASE (NON,NAND) ET PROFONDEUR DES CIRCUITS A MATRICES LOGIQUES PROGRAMMABLESGORLOV VV; LEBEDEV VI.1982; AVTOM. VYCISL. TEH.; ISSN 504858; SUN; DA. 1982; NO 3; PP. 33-38; BIBL. 8 REF.Article

SUR LA PROBABILITE ASSOCIEE AUX SOUS-ENSEMBLES NEGLIGEABLES D'ARGUMENTS DE FONCTIONS BOOLEENNESBIBILO PN.1982; AVTOM. VYCISL. TEH.; ISSN 504858; SUN; DA. 1982; NO 4; PP. 68-70; BIBL. 5 REF.Article

A SIMPLER METHOD FOR MINIMIZATION OF SWITCHING FUNCTIONSKANTI BHUSAN BHOWMIK; PRAMODE RANJAN BHATTACHARJEE; SUSANTA MODAK et al.1981; INT. J. COMPUT. MATH.; ISSN 0020-7160; GBR; DA. 1981; VOL. 10; NO 1; PP. 77-89; BIBL. 9 REF.Article

CHARACTERISTIC FUNCTIONS IN MULTIVALUED LOGIC SYSTEMSCERNY E.1980; DIGIT. PROCESSES; ISSN 0301-4185; CHE; DA. 1980; VOL. 6; NO 2-3; PP. 167-174; ABS. FRE/GER; BIBL. 5 REF.Article

EQUIVALENCE OF FREE BOOLEAN GRAPHS CAN BE DECIDED PROBABILISTICALLY IN POLYNOMIAL TIMEBLUM M; CHANDRA AK; WEGMAN MN et al.1980; INFORM. PROCESSG LETTERS; NLD; DA. 1980; VOL. 10; NO 2; PP. 80-82; BIBL. 5 REF.Article

GENERALIZED INVERSES OF BOOLEAN FUNCTIONSMELTER RA; RUDEANU S.1980; REV. ROUM. MATH. PURES APPL.; ISSN 0035-3965; ROM; DA. 1980; VOL. 25; NO 7; PP. 891-897; BIBL. 2 REF.Article

MINIMALLY TESTABLE REED-MULLER CANONICAL FORMSPAGE EW.1980; IEEE TRANS. COMPUT.; ISSN 0018-9340; USA; DA. 1980; VOL. 29; NO 8; PP. 746-750; BIBL. 4 REF.Article