UNDECIDABILITY OF PDL WITH L=(A2I/I-GREATER-THAN-OR-EQUAL-TO-O)

被引：3

作者：

HAREL, D ^{[1
]}

PATERSON, MS ^{[1
]}

机构：

[1] UNIV WARWICK,DEPT COMP SCI,COVENTRY CV4 7AL,W MIDLANDS,ENGLAND

来源：

关键词：

D O I：

10.1016/0022-0000(84)90005-9

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：359 / 365

页数：7

共 12 条

[1]

Berger R., 1966, MEM AM MATH SOC, V66

[2] PROPOSITIONAL DYNAMIC LOGIC OF REGULAR PROGRAMS [J].

FISCHER, MJ ;

LADNER, RE .

[3] PROPOSITIONAL DYNAMIC LOGIC OF NONREGULAR PROGRAMS [J].

HAREL, D ;

PNUELI, A ;

STAVI, J .

[4]

HAREL D, 1983, LECT NOTES COMPUT SC, V158, P177

[5]

HAREL D, 1983, HDB PHILOS LOGIC, V2

[6]

HAREL D, 1984, JAN P LOG COMP C CLA

[7] AN ELEMENTARY PROOF OF THE COMPLETENESS OF PDL [J].

KOZEN, D ;

PARIKH, R .

[8]

OLSHANSKY T, UNPUB THERE EXIST DE

[9]

Pratt V. R., 1979, 20th Annual Symposium of Foundations of Computer Science, P115, DOI 10.1109/SFCS.1979.24

[10]

Pratt V.R., 1976, FOCS, P109, DOI [10.1109/SFCS.1976.27, DOI 10.1109/SFCS.1976.27]