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

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

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

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 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

DEFINABILITY IN DYNAMIC LOGICMEYER AR; PARIKH R.1980; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 12/1980/LOS ANGELES CA; USA; NEW YORK: ACM; DA. 1980; PP. 1-9; BIBL. 9 REF.Conference Paper

COMPACTNESS IN MODELS OF PROPOSITIONAL DYNAMIC LOGICBERMAN F.1982; COMPUT. LINGUIST. COMPUT. LANG.; ISSN 0324-2048; HUN; DA. 1982; VOL. 15; PP. 7-19; BIBL. 6 REF.Article

FORMAL CORRECTNESS PROOFS OF A NONDETERMINISTIC PROGRAMUPFAL E.1982; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1982; VOL. 14; NO 2; PP. 86-92; BIBL. 7 REF.Article

FIRST ORDER DYNAMIC LOGIC WITH DECIDABLE PROOFS AND WORKABLE MODEL THEORYSAIN I.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 117; PP. 334-340; BIBL. 7 REF.Conference Paper

ON INDUCTION VS-CONTINUITYKOZEN D.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981 PUBL. 1982; NO 131; PP. 167-176; BIBL. 15 REF.Conference Paper

PROPOSITIONAL DYNAMIC LOGIC IS WEAKER WITHOUT TESTSBERMAN F; PATERSON M.1981; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1981; VOL. 16; NO 3; PP. 321-328; BIBL. 5 REF.Article

LOGICS OF PROGRAMS AND THEIR APPLICATIONS. A SYMPOSIUM HELD IN POZNAN, POLAND ON AUGUST 23-29, 1980. PROCEEDINGSSALWICKI A.1983; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1983; VOL. 148; VI-324 P.; BIBL. DISSEM.Conference Paper

NONSTANDARD MODELS IN PROPOSITIONAL DYNAMIC LOGICBERMAN F.1983; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1983; VOL. 148; PP. 81-85; BIBL. 3 REF.Conference Paper

SEMANTICS OF LOOPING PROGRAMS IN PROPOSITIONAL DYNAMIC LOGICBERMAN F.1982; MATHEMATICAL SYSTEMS THEORY; ISSN 0025-5661; DEU; DA. 1982; VOL. 15; NO 4; PP. 285-294; BIBL. 8 REF.Article

A NOTE ON EQUIVALENCES AMONG LOGICS OF PROGRAMSMEYER AR; TIURYN J.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981 PUBL. 1982; NO 131; PP. 282-299; BIBL. 27 REF.Conference Paper

The propositional dynamic logic of deterministic, well-structured programsHALPERN, J. Y; REIF, J. H.Theoretical computer science. 1983, Vol 27, Num 1-2, pp 127-165, issn 0304-3975Article

Intention and rationality for PRS-like agentsWOBCKE, Wayne.Lecture notes in computer science. 2002, pp 167-178, issn 0302-9743, isbn 3-540-00197-2, 12 p.Conference Paper