返回Google圖書搜尋

Final Algebras, Cosemicomputable Algebras, and Degrees of Unsolvability

出版	SRI International, Computer Science Laboratory, 1991
URL	http://books.google.com.hk/books?id=r2uLuwEACAAJ&hl=&source=gbs_api

註釋Abstract: "Rewriting with conditional rewrite rules modulo a set E of structural axioms provides a general framework for unifying a wide variety of models of concurrency. Concurrent rewriting coincides with logical deduction in conditional rewriting logic, a logic of actions whose models are concurrent systems. This logic is sound and complete and has initial models. In addition to general models interpreted as concurrent systems which provide a more operational style of semantics, more restricted semantics with an incresingly [sic] denotational flavor such as preorder, poset, cpo, and standard algebraic models appear as special cases of the model theory.