Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("DECIDABILITE")

Filter

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

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 2575

  • Page / 103

Export

Selection :

  • and

NEW TECHNIQUES AND RESULTS IN MULTIDIMENSIONAL PROBLEMS.BOSE NK.1976; J. FRANKLIN INST.; U.S.A.; DA. 1976; VOL. 301; NO 1-2; PP. 83-101; BIBL. 3 P.Article

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

OMITTING TYPES, TYPE SPECTRUMS, AND DECIDABILITYMILLAR T.1983; JOURNAL OF SYMBOLIC LOGIC; ISSN 0022-4812; USA; DA. 1983; VOL. 48; NO 1; PP. 171-181; BIBL. 4 REF.Article

SUR UNE CLASSE DE CORPS INDECIDABLESJENSEN CU.1982; C.R. SEANCES ACAD. SCI., SER. 1, MATH.; ISSN 0249-6291; FRA; DA. 1982; VOL. 295; NO 9; PP. 507-509; ABS. ENG; BIBL. 8 REF.Article

DE LA POSSIBILITAT A L'EFICIENCIA: UN INTENT D'EXPLICAR EN FORMA ENTENEDORA ALGUNS ASPECTES TEORICS DE LA CALCULACIO = DE LA POSSIBILITE A L'EFFICACITE: UNE TENTATIVE D'EXPLICATION DE QUELQUES ASPECTS THEORIQUES DE LA CALCULABILITECASAS R; DIAZ J.1981; NOVATICA; ISSN 0211-2124; ESP; DA. 1981; VOL. 7; NO 38-39; PP. 7-15; 7 P.; BIBL. 4 REF.Article

SOME GRAPH THEORETICAL OPERATIONS AND DECIDABILITYSEESE DG.1979; MATH. NACHR.; DDR; DA. 1979; VOL. 87; PP. 15-21; BIBL. 8 REF.Article

DECIDABILITY OF A PORTION OF THE PREDICATE CALCULUS.SHELAH S.1977; ISRAEL J. MATH.; ISRAEL; DA. 1977; VOL. 28; NO 1-2; PP. 32-44; BIBL. 4 REF.Article

THE DECIDABILITY OF THE EQUIVALENCE PROBLEM FOR POLYNOMIALLY BOUNDED DOL SEQUENCES.KARHUMAKI J.1977; R.A.I.R.O., INFORMAT. THEOR.; FR.; DA. 1977; VOL. 11; NO 1; PP. 17-28; ABS. FR.; BIBL. 9 REF.Article

A TERNARY UNIVERSAL DECISION ELEMENT.MUZIO JE; MILLER DM.1976; NOTRE DAME J. FORM. LOGIC; U.S.A.; DA. 1976; VOL. 17; NO 4; PP. 632-637; BIBL. 9 REF.Article

DIE INSEPARABILITAETSEIGENSCHAFT UND DIE RICESCHE UNENTSCHEIDBARKEITSEIGENSCHAFT BEI EFFEKTIVEN NUMERIERUNGEN. = LA PROPRIETE D'INSEPARABILITE ET LA PROPRIETE D'INDECIDABILITE DE RICE DANS LE CAS DE LA NUMERATION EFFECTIVEGOETZE BG.1975; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1975; VOL. 11; NO 10-12; PP. 583-586; BIBL. 6 REF.; (INT. SYMP. DISKRETE MATH. ANWEND. MATH. KYBERN.; BERLIN; 1974). RESUMEConference Paper

ENTSCHEIDBARKEIT IN DER THEORIE BAUMARTIGER GRAPHEN. = LA DECIDABILITE DANS LA THEORIE DES QUASI-ARBRESHAVSCHILD K.1975; WISSENSCH. Z. HUMBOLDT-UNIV. BERLIN, MATH.-NATURWISSENSCH. REIHE; DTSCH.; DA. 1975; VOL. 24; NO 6; PP. 764-768; ABS. RUSSE ANGL. FR.; BIBL. 8 REF.Article

CALCULS COMBINATOIRES. IISHABUNIN LV.1975; VEST. MOSKOV. UNIV., 1; S.S.S.R.; DA. 1975; VOL. 30; NO 2; PP. 10-14; ABS. ANGL.; BIBL. 3 REF.Article

UNENTSCHEIDBARKEIT IN DER GRAPHENTHEORIE = NON-DECIDABILITE DANS LA THEORIE DES GRAPHESBOWEN KA; HERRE H.1973; BULL. ACAD. POLON. SCI., SCI. MATH. ASTR. PHYS.; POLOGNE; DA. 1973; VOL. 21; NO 3; PP. 201-208; ABS. RUSSE; BIBL. 6 REF.Serial Issue

INTERPRETIERBARKEIT UND ENTSCHEIDBARKEIT IN DER GRAPHENTHEORIE II = INTERPRETABILITE ET DECIDABILITE DANS LA THEORIE DES GRAPHESHAUSCHILD K; HERRE H; RAUTENBERG W et al.1972; Z. MATH. LOGIK GRUNDL. MATH.; DTSCH.; DA. 1972; VOL. 18; NO 5; PP. 457-480; BIBL. 13 REF.Serial Issue

A SIMPLIFICATION OF COMBINATORY LOGICGOODMAN ND.1972; J. SYMBOL. LOGIC; U.S.A.; DA. 1972; VOL. 37; NO 2; PP. 225-246; BIBL. 4 REF.Serial Issue

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

  • Page / 103