ALTERNATIVE FORMS OF PROPOSITIONAL CALCULUS FOR A GIVEN DEDUCTION THEOREMBUNDER MW.1979; NOTRE DAME J. FORM. LOGIC; USA; DA. 1979; VOL. 20; NO 3; PP. 613-619; BIBL. 6 REF.Article

QUELQUES ALGORITHMES DE PERMUTATIONS.VIENNOT G.1976; ASTERISQUE; FR.; DA. 1976; NO 38-39; PP. 275-293; BIBL. 1 P. 1/2; (JOURN. ALGORITHMIQUES. CONF.; PARIS; 1975)Conference Paper

A CONSTRUCTIVE GENERALIZATION OF THE BOREL-CANTELLI LEMMA WITH APPLICATION TO THE COMPLEXITY OF INFINITE STRINGSDE MILLO RA; LIPTON RJ.1979; MATH. SYST. THEORY; USA; DA. 1979; VOL. 13; NO 2; PP. 95-104; BIBL. 7 REF.Article

CHARACTERIZATION OF NORMAL FORMS POSSESSING INVERSE IN THE LAMBDA -BETA -ETA -CALCULUS.DEZANI CIANCAGLINI M.1976; THEOR. COMPUTER SCI.; NETHERL.; DA. 1976; VOL. 2; NO 3; PP. 323-337; BIBL. 3 REF.Article

A CONSISTENT COMBINATORY LOGIC WITH AN INVERSE TO EQUALITYFITCH FB.1980; J. SYMB. LOGIC; ISSN 0022-4812; USA; DA. 1980; VOL. 45; NO 3; PP. 529-543; BIBL. 16 REF.Article

LAMBDA -ELIMINATION IN ILLATIVE COMBINATORY LOGICBUNDER MW.1979; NOTRE DAME J. FORM. LOGIC; USA; DA. 1979; VOL. 20; NO 3; PP. 628-630; BIBL. 4 REF.Article

LOGIQUE COMBINATOIRE.LAGASSE J; COURVOISIER M; RICHARD JP et al.1976; PARIS; DUNOD; DA. 1976; PP. (80P.); BIBL. 6 REF.; ISBN 2040001476; 3EME ED. (DUNOD UNIV.)Book

PROBABILISTIC APPROACH TO MULTIPLEXER LOGIC CIRCUIT DESIGNEKTARE AB; MITAL DP.1980; ELECTRON. LETTERS; GBR; DA. 1980; VOL. 16; NO 18; PP. 686-687; BIBL. 7 REF.Article

SIGNIFICANCE AND ILLATIVE COMBINATORY LOGICSBUNDER RW.1980; NOTRE DAME J. FORM. LOGIC; USA; DA. 1980; VOL. 21; NO 2; PP. 380-384; BIBL. 7 REF.Article

ON THE EQUIVALENCE OF SYSTEMS OF RULES AND SYSTEMS OF AXIOMS IN ILLATIVE COMBINATORY LOGICBUNDER MW.1979; NOTRE DAME J. FORM. LOGIC; USA; DA. 1979; VOL. 20; NO 3; PP. 603-608; BIBL. 9 REF.Article

SCOTT'S MODELS AND ILLATIVE COMBINATORY LOGICBUNDER MW.1979; NOTRE DAME J. FORM. LOGIC; USA; DA. 1979; VOL. 20; NO 3; PP. 609-612; BIBL. 10 REF.Article

INTERNAL FRAGMENTATION IN A CLAN OF BUDDY SYSTEMS.RUSSELL DL.1977; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1977; VOL. 6; NO 4; PP. 607-621; BIBL. 11 REF.Article

LOWER BOUNDS FOR THE SIZE OF EXPRESSIONS FOR CERTAIN FUNCTIONS IN D-ARY LOGIC.VILFAN B.1976; THEOR. COMPUTER SCI.; NETHERL.; DA. 1976; VOL. 2; NO 2; PP. 249-269; BIBL. 17 REF.Article

A THEORY OF COMPUTATION WITH AND IDENTITY DISCRIMINATOR.LONGO G; VENTURINI ZIPLI M.1976; IN: AUTOM. LONG. PROGRAM. INT. COLLOQ.3; EDINBURGH; 1976; EDINBURGH; UNIV. PRESS; DA. 1976; PP. 147-167; BIBL. 1 P.Conference Paper

SOME NEW TYPES OF LOGICAL COMPLETENESSKARUNANITHI S; FRIEDMAN AD.1978; I.E.E.E. TRANS. COMPUTERS; USA; DA. 1978; VOL. 27; NO 11; PP. 998-1005; BIBL. 8 REF.Article

HIERARCHIES DE COMPLEXITE ET REDUCTIONS ENTRE PROBLEMES.FLAJOLET P; STEYAERT JM.1976; ASTERISQUE; FR.; DA. 1976; NO 38-39; PP. 53-72; BIBL. 26 REF.; (JOURN. ALGORITHMIQUES. CONF.; PARIS; 1975)Conference Paper

UN MODELE ARITHMETIQUE DES TERMES DE LA LOGIQUE COMBINATOIREBOHM C.1979; LAMBDA CALCUL ET SEMANTIQUE FORMELLE DES LANGAGES DE PROGRAMMATION. ECOLE DE PRINTEMPS D'INFORMATIQUE THEORIQUE. 6/1978/LA CHATRE; FRA; PARIS: LABORATOIRE D'INFORMATIQUE THEORIQUE ET PROGRAMMATION/PARIS: ECOLE NATIONALE SUPERIEURE DE TECHNIQUES AVANCEES; DA. 1979; PP. 97-108; BIBL. 7 REF.Conference Paper

A NEW IMPLEMENTATION TECHNIQUE FOR APPLICATIVE LANGUAGESTURNER A.1979; SOFTWARE PRACT. EXPER.; GBR; DA. 1979; VOL. 9; NO 1; PP. 31-49; BIBL. 14 REF.Article

SEQUENCE SEARCH TREES: THEIR ANALYSIS USING RECURRENCE RELATIONS.WILSON LB.1976; B.I.T.; DANM.; DA. 1976; VOL. 16; NO 3; PP. 332-337; BIBL. 6 REF.Article

AN ANALYSIS OF BINARY SEARCH TREES FORMED FROM SEQUENCES OF NONDISTINCT KEYS.BURGE WH.1976; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1976; VOL. 23; NO 3; PP. 451-454; BIBL. 4 REF.Article

AN APPLICATION OF PATTERN MATCHING TO A PROBLEM IN GEOMETRICAL COMPLEXITY.MANACHER G.1976; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1976; VOL. 5; NO 1; PP. 6-7; BIBL. 4 REF.Article

CALCULS FINIS ET INFINIS SUR LES TERMES COMBINATOIRESCANAL R; VIGNOLLE J.1979; LAMBDA CALCUL ET SEMANTIQUE FORMELLE DES LANGAGES DE PROGRAMMATION. ECOLE DE PRINTEMPS D'INFORMATIQUE THEORIQUE. 6/1978/LA CHATRE; FRA; PARIS: LABORATOIRE D'INFORMATIQUE THEORIQUE ET PROGRAMMATION/PARIS: ECOLE NATIONALE SUPERIEURE DE TECHNIQUES AVANCEES; DA. 1979; PP. 109-130; BIBL. 3 P.Conference Paper

A SPECIAL CLASS OF UNIVERSAL LOGIC GATES (ULG) AND THEIR EVALUATION UNDER THE WALSH TRANSFORM.EDWARDS CR.1978; INTERNATION. J. ELECTRON.; GBR; DA. 1978; VOL. 44; NO 1; PP. 49-59; BIBL. 5 REF.Article

ALGORITHME ASYMPTOTIQUEMENT OPTIMAL DE CONSTRUCTION DES TESTS A IMPASSESDYUKOVA EV.1977; DOKL. AKAD NAUK S.S.S.R.; S.S.S.R.; DA. 1977; VOL. 233; NO 4; PP. 527-530; BIBL. 2 REF.Article

ARBRES BINAIRES DE RECHERCHE: PROPRIETES COMBINATOIRES ET APPLICATIONS.FRANCON J.1976; REV. FR. AUTOMAT. INFORMAT. RECH. OPERAT.; FR.; DA. 1976; VOL. 10; NO 12; PP. 35-50; BIBL. 15 REF.Article