Process logic: Expressiveness, decidability, completeness
- 作者David Harel; Dexter Kozen; Rohit Parikh
- 卷第25卷
- 期第2期
- 印刷ISSN0022-0000
- 电子ISSN1090-2724
- 文件大小1696.10KB
- 发表时间1982
- DOI10.1016/0022-0000(82)90003-4
- 页码144-170
同作者推荐
50 Years of TOCSAlan L. Selman,Arnold L. Rosenberg · Theory of Computing Systems · 2017
Arithmetical Reducibilities IAlan L. Selman · 1971
Arithmetical Reducibilities IIAlan L. Selman · 1972
Relativized Halting ProblemsAlan L. Selman · 1974
Editor's forewordAlan L. Selman · 1982
Editor's forewordAlan L. Selman · 1982
Qualitative relativizations of complexity classesRonald V. Book; Timothy J. Long; Alan L. Selman · 1985
Editors' forewordSteve Mahaney; Alan L. Selman · 1989