Abstract
It is well known that for the case of a countable partial order, the ideal completion and the chain completion coincide. We investigate the boundary at which the chain and ideal completion do not coincide. We show in particular that the ideal completion is not sequentially adequate; that is it is not possible in general to simply replace the ideal completion with a completion based on sequences as for instance the chain completion. The implications of this result for the Yoneda completion ([!]) and for the Smyth completion ([7,8,9,10,11]) which are based on the ideal completion, are discussed in an extended version of this paper, reported in [5].
| Original language | English |
|---|---|
| Pages (from-to) | 87-93 |
| Number of pages | 7 |
| Journal | Electronic Notes in Theoretical Computer Science |
| Volume | 35 |
| DOIs | |
| Publication status | Published - 2000 |
| Event | Workshop on Domains IV - Rolandseck, Germany Duration: 2 Oct 1998 → 4 Oct 1998 |
Fingerprint
Dive into the research topics of 'The ideal completion is not sequentially adequate'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver