登入選單

返回Google圖書搜尋

Final Algebras, Cosemicomputable Algebras, and Degrees of Unsolvability

Lawrence Stuart MossJosé MeseguerJoseph Goguen

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

註釋

Abstract: "This paper studies some computability notions for abstract data types, and in particular compares cosemicomputable many- sorted algebras with a notion of finality to model minimal-state realizations of abstract (software) machines. Given a finite many-sorted signature [sigma] and a set V of visible sorts, for every [sigma]-algebra A with co-r.e. behavior and nontrivial, computable V-behavior, there is a finite signature extension [sigma] ́of [sigma] (without new sorts) and a finite set E of [sigma]-́equations such that A is isomorphic to a reduct of the final ([sigma], ́ E)-algebra relative to V.