Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("LOGIQUE DYNAMIQUE")

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 186

  • Page / 8
Export

Selection :

  • and

DYNAMIC LOGICPRATT VR.1982; STUD. LOG. FOUND. MATH.; ISSN 0049-237X; NLD; DA. 1982; VOL. 104; PP. 251-261; BIBL. 15 REF.Conference Paper

THE DEDUCTIBILITY PROBLEM IN PROPOSITIONAL DYNAMIC LOGICMEYER AR; STREET R; MIRKOWSKA G et al.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 115; PP. 238-248; BIBL. 7 REF.Conference Paper

AN ELEMENTARY PROOF OF THE COMPLETNESS OF PDLKOZEN D; PARIKH R.1981; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1981; VOL. 14; NO 1; PP. 113-118; BIBL. 11 REF.Article

FINITE MODELS FOR DETERMINISTIC PROPOSITIONAL DYNAMIC LOGICBEN ARI M; HALPERN JY; PNUELI A et al.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 115; PP. 249-263; BIBL. 10 REF.Conference Paper

PROPOSITIONAL DYNAMIC LOGIC FOR CONCURRENT PROGRAMSNISHIMURA H.1982; PUBL. RES. INST. MATH. SCI.; ISSN 508233; JPN; DA. 1982; VOL. 18; NO 1; PP. 233-250; BIBL. 10 REF.Article

PROOF THEORETIC METHODOLOGY FOR PROPOSITIONAL DYNAMIC LOGICLEIVANT D.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 107; PP. 356-373; BIBL. 16 REF.Conference Paper

MEASURING THE EXPRESSIVE POWER OF DYNAMIC LOGICS: AN APPLICATION OF ABSTRACT MODEL THEORYMAKOWSKY JA.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; NO 85; PP. 409-421; BIBL. 8 REF.Conference Paper

DETERMINISTIC PROPOSITIONAL DYNAMIC LOGIC: FINITE MODELS, COMPLEXITY, AND COMPLETENESSMORDECHAI BAE BEN ARI; HALPERN JY; PNUELLI A et al.1982; JOURNAL OF COMPUTER AND SYSTEM SCIENCES; ISSN 0022-0000; USA; DA. 1982; VOL. 25; NO 3; PP. 402-417; BIBL. 10 REF.Article

SEQUENTIAL METHOD IN PROPOSITIONAL DYNAMIC LOGICNISHIMURA H.1979; ACTA INFORMAT.; DEU; DA. 1979; VOL. 12; NO 4; PP. 377-400; BIBL. 16 REF.Article

NONSTANDARD DYNAMIC LOGICNEMETI I.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981 PUBL. 1982; NO 131; PP. 311-348; BIBL. 23 REF.Conference Paper

SHARPENING THE CHARACTERIZATION OF THE POWER OF FLOYD METHODANDREKA H.1983; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1983; VOL. 148; PP. 1-26; BIBL. 29 REF.Conference Paper

SEMANTICAL ANALYSIS OF CONSTRUCTIVE PDLNISHIMURA H.1982; PUBL. RES. INST. MATH. SCI.; ISSN 508233; JPN; DA. 1982; VOL. 18; NO 2; PP. 427-438; BIBL. 6 REF.Article

MAKING DYNAMIC LOGIC FIRST-ORDERHAJEK P.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 118; PP. 287-295; BIBL. 9 REF.Conference Paper

DYNAMIC ALGEBRAS AND THE NATURE OF INDUCTIONPRATT VR.1980; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 12/1980/LOS ANGELES CA; USA; NEW YORK: ACM; DA. 1980; PP. 22-28; BIBL. 19 REF.Conference Paper

PROPOSITIONAL DYNAMIC LOGIC OF LOOPING AND CONVERSESTREETT RS.1981; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 13/1981/MILWAUKEE WI; USA; NEW YORK: ASSOCIATION FOR COMPUTING MACHINERY; DA. 1981; PP. 375-383; BIBL. 14 REF.Conference Paper

USING GRAPHS TO UNDERSTAND PDLPRATT VR.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981 PUBL. 1982; NO 131; PP. 387-396; BIBL. 14 REF.Conference Paper

ON SOME EXTENSIONS OF DYNAMIC LOGICORLOWSKA E.1983; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1983; VOL. 148; PP. 205-212; BIBL. 5 REF.Conference Paper

EVERY FREE ALGEBRA IN THE VARIETY GENERATED BY THE REPRESENTABLE DYNAMIC ALGEBRA IS SEPARABLE AND REPRESENTABLENEMETI I.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 17; NO 3; PP. 343-347; BIBL. 8 REF.Article

EXPRESSING PROGRAM LOOPING IN REGULAR DYNAMIC LOGICMEYER AR; WINKLMANN K.1982; THER. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 18; NO 3; PP. 301-323; BIBL. 13 REF.Article

IS THE INTERESTING PART OF PROCESS LOGIC UNINTERESTING.: A TRANSLATION FROM PL TO PDLSHERMAN R; PNUELI A; HAREL D et al.1982; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES. 9/1982-01-25/ALBUQUERQUE NM; USA; NEW YORK: ACM; DA. 1982; PP. 347-360; BIBL. 12 REF.Conference Paper

A COMPLETE LOGIC FOR REASONING ABOUT PROGRAMS VIA NONSTANDARD MODEL THEORY IIANDREKA H; NEMETI I; SAIN I et al.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 17; NO 3; PP. 259-278; BIBL. 26 REF.Article

A COMPLETE LOGIC FOR REASONING ABOUT PROGRAMS VIA NONSTANDARD MODEL THEORYANDREKA H; NEMETI I; SAIN I et al.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 17; NO 2; PP. 193-212; BIBL. 32 REF.Article

FURTHER RESULTS ON PROPOSITIONAL DYNAMIC LOGIC OF NONREGULAR PROGRAMSHAREL D; PNUELI A; STAVI J et al.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981 PUBL. 1982; NO 131; PP. 124-136; BIBL. 5 REF.Conference Paper

LOGICS FOR PROBABILISTIC PROGRAMMINGREIF JH.1980; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 12/1980/LOS ANGELES CA; USA; NEW YORK: ACM; DA. 1980; PP. 8-13; BIBL. 18 REF.Conference Paper

ON THE POWER OF NONDETERMINISM IN DYNAMIC LOGICBERMAN P; HALPERN JY; TIURYN J et al.1982; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1982; VOL. 140; PP. 48-60; BIBL. 7 REF.Conference Paper

  • Page / 8