Skip Navigation

The Computer Journal 1990 33(6):570-572; doi:10.1093/comjnl/33.6.570
© 1990 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Chen, T. Y.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

On the Consistency of Multi-valued Functions*

T. Y. Chen §

Department of Computer Science, University of Melbourne, Parkville 3052, Australia

Gallier1 generalised the notion of consistency in studying the sufficient conditions for the existence of optimal fixpoints. Chen2 introduced the notion of <=-relatedness in investigating some fixpoints for the class of non-deterministic recursive programs. In this paper, it is proved that the notions of <=-relatedness and consistency are equivalent for the class of multi-valued functions.

Received August 1986. revised December 1986.

* This paperis a revised versionOn Consisitency of Non-Determinism, Technical Report TR-A4-84, Centre of Computer Studies and Applications, University of Hong Kong, Hong Kong

§ Department of Computer Science, University of Melbourne, Parkville 3052, Australia


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.