| dc.contributor.author | Ying Mingsheng | en_US |
| dc.contributor.editor | en_US | |
| dc.date.accessioned | 2010-05-28T09:47:17Z | |
| dc.date.available | 2010-05-28T09:47:17Z | |
| dc.date.issued | 1996 | en_US |
| dc.identifier | 2008004859 | en_US |
| dc.identifier.citation | Ying Mingsheng 1996, 'When Is The Ideal Completion Of Abstract Basis Algebraic', Elsevier Science Bv, vol. 159, no. 2, pp. 355-356. | en_US |
| dc.identifier.issn | 0304-3975 | en_US |
| dc.identifier.other | C1 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10453/9074 | |
| dc.description.abstract | The concepts of abstract basis and its ideal completion play an important role in domain theory because the category of bases (and approximable relations) is equivalent to the category of continuous domains (and continuous mappings) (cf. [1, Theorem 2.2. | en_US |
| dc.language | en_US | |
| dc.publisher | Elsevier Science Bv | en_US |
| dc.relation.isbasedon | NA | en_US |
| dc.title | When Is The Ideal Completion Of Abstract Basis Algebraic | en_US |
| dc.parent | Theoretical Computer Science | en_US |
| dc.journal.volume | 159 | en_US |
| dc.journal.number | 2 | en_US |
| dc.publocation | Amsterdam | en_US |
| dc.identifier.startpage | 355 | en_US |
| dc.identifier.endpage | 356 | en_US |
| dc.cauo.name | FEIT.School of Systems, Management and Leadership | en_US |
| dc.conference | Verified OK | en_US |
| dc.for | 080203 | en_US |
| dc.personcode | 103396 | en_US |
| dc.percentage | 000050 | en_US |
| dc.classification.name | Computational Logic and Formal Languages | en_US |
| dc.classification.type | FOR-08 | en_US |
| dc.edition | en_US | |
| dc.custom | en_US | |
| dc.date.activity | en_US | |
| dc.location.activity | en_US | |
| dc.description.keywords | NA | en_US |
| dc.staffid | Tsinghua University | en_US |