Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("LOGIQUE COMBINATOIRE")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 420

  • Page / 17

Export

Selection :

  • and

A SHORT EQUATIONAL AXIOMATIZATION OF ORTHOMODULAR LATTICES.SOBOCINSKI B.1976; NOTRE DAME J. FORM. LOGIC; U.S.A.; DA. 1976; VOL. 17; NO 2; PP. 317-320; BIBL. 4 REF.Article

THREE IDENTITIES FOR ORTHOLATTICES.BERAN L.1976; NOTRE DAME J. FORM. LOGIC; U.S.A.; DA. 1976; VOL. 17; NO 2; PP. 251-252; BIBL. 1 REF.Article

A SHORT EQUATIONAL AXIOMATIZATION OF MODULAR ORTHOLATTICES.SOBOCINSKI B.1976; NOTRE DAME J. FORM. LOGIC; U.S.A.; DA. 1976; VOL. 17; NO 2; PP. 311-316; BIBL. 7 REF.Article

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

ON BACKTRACK PROGRAMMING AND SOME RESULTS ON COMBINATORIAL PUZZLES.KAWAI S; NOSHITA K; TAKEUCHI I et al.1975; IN: U.S.A.-JAP. COMPUT. CONF. 2. PROC.; TOKYO; 1975; MONTVALE; AM. FED. INF. PROCESS. SOC.; DA. 1975; PP. 300-305; BIBL. 5 REF.Conference Paper

SUR UN THEOREME DE THUEDEJEAN F.1972; J. COMBINATOR. THEORY, A; U.S.A.; DA. 1972; VOL. 13; NO 1; PP. 90-99; BIBL. 19 REF.Serial Issue

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

PERMUTATION ENUMERATION: FOUR NEW PERMUTATION ALGORITHMS.IVES FM.1976; COMMUNIC. A.C.M.; U.S.A.; DA. 1976; VOL. 19; NO 2; PP. 68-72; 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

QUELQUES ESPACES COMBINATOIRES LIES A LA COMPLEXITE DU TRAITEMENT DES DONNEESSKORDEV DG.1976; C.R. ACAD. BULG. SCI.; BULG.; DA. 1976; VOL. 29; NO 1; PP. 7-10; BIBL. 2 REF.Article

QUELQUES MODELES DE LOGIQUE COMBINATOIRESKORDEV D.1976; MAT. ZAMET.; S.S.S.R.; DA. 1976; VOL. 19; NO 1; PP. 149-154; BIBL. 3 REF.Article

THEORIE DES OBJETS ET THEORIE DES ENSEMBLES.CHAUVIN A.1974; AO-CNRS-11217; FR.; DA. 1974; PP. 1-134; BIBL. DISSEM.; (THESE DOCT. SCI.-MATH.; CLERMONT-FERRAND)Thesis

EXTRACTING LISP PROGRAMS FROM CONSTRUCTIVE PROOFS: A FORMAL THEORY OF CONSTRUCTIVE MATHEMATICS BASED ON LISPHAYASHI S.1983; PUBLICATIONS OF THE RESEARCH INSTITUTE FOR MATHEMATICAL SCIENCES; ISSN 508233; JPN; DA. 1983; VOL. 19; NO 1; PP. 169-191; BIBL. 13 REF.Article

COMPLETENESS, INVARIANCE AND LAMBDA -DEFINABILITYSTATMAN R.1982; J. SYMB. LOGIC; ISSN 0022-4812; USA; DA. 1982; VOL. 47; NO 1; PP. 17-26; BIBL. 9 REF.Article

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

AN EFFICIENT IMPLEMENTATION OF EDMONDS' ALGORITHM FOR MAXIMUM MATCHING ON GRAPHS.GABOW HN.1976; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1976; VOL. 23; NO 2; PP. 221-234; BIBL. 13 REF.Article

A BIT-PUSHING SHORTEST DISTANCE ALGORITHM.ROSENTHAL A.1975; NETWORKS; U.S.A.; DA. 1975; VOL. 5; NO 4; PP. 301-305; BIBL. 2 REF.Article

A PROPERTY WHICH GUARANTECS TERMINATION IN WEAK COMBINATORY LOGIC AND SUBTREE REPLACEMENT SYSTEMSPETTOROSSI A.1981; NOTRE DAME J. FORMAL LOGIC; ISSN 0029-4527; USA; DA. 1981; VOL. 22; NO 4; PP. 344-356; BIBL. 8 REF.Article

DEUX PROPRIETES COMBINATOIRES DU LANGAGE DE LUKASIEWICZ.GOUYOU BEAUCHAMPS D.1975; REV. FR. AUTOMAT. INFORMAT. RECH. OPERAT., R, INFORMAT. THEOR.; FR.; DA. 1975; VOL. 9; NO 3; PP. 13-24; ABS. ANGL.; BIBL. 1 P.Article

COMBINATORY LOGIC AND THE AXIOM OF CHOICEBARENDREGT H.1973; PROC. KKL. NEDERL. AKAD. WETENSCH., A; NETHERL.; DA. 1973; VOL. 76; NO 3; PP. 203-221; BIBL. 6 REF.Serial Issue

NOTES ON COMBINATORIAL SET THEORYSHELAH S.1973; ISRAEL J. MATH.; ISRAEL; DA. 1973; VOL. 14; NO 3; PP. 262-277; BIBL. 16 REF.Serial Issue

COMBINATIONAL NETWORK DESIGN FOR PNEUMATIC MPL CIRCUITS I. BASIC ELEMENTSPARRISH J.1983; HYDRAULICS AND PNEUMATICS; ISSN 0018-814X; USA; DA. 1983; VOL. 36; NO 2; PP. 44-48; 4 P.; BIBL. 1 REF.Article

  • Page / 17