DSpace at IIT Bombay >
IITB Publications >
Please use this identifier to cite or link to this item:
|Title: ||A direct characterization of completion|
|Authors: ||RAMESH, S|
|Issue Date: ||1996|
|Publisher: ||ELSEVIER SCIENCE BV|
|Citation: ||THEORETICAL COMPUTER SCIENCE, 154(2), 379-385|
|Abstract: ||Canonical Completion of a poset is of central importance in obtaining fully abstract semantic models. Stoughton, in his thesis, has described a completion technique. In this short note, we provide a direct characterization of the cpo constructed using this technique. This characterization shows that the completed poset consists of all closed continuously directed subsets of the original poset and vice versa. This result is stated as a conjecture by Stoughton.|
|Appears in Collections:||Article|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.