@inproceedings{8de834c6f39e4191a5e7c8298ae3c4c3,

title = "On the Herbrand Kleene universe for nondeterministic computations",

abstract = "For nondeterministic recursive equations over an arbitrary signature of function symbols including the nondeterministic choice operator “or” the interpretation is factorized according to the techniques developed by the present author (1982). It is shown that one can either associate an infinite tree with the equations, then interpret the function symbol “or” as a nondeterministic choice operator and so mapping the tree onto a set of infinite trees and then interpret these trees. Or one can interpret the recursive equation directly yielding a set-valued function. Both possibilities lead to the same result, i.e., one obtains a commuting diagram. However, one has to use more refined techniques than just powerdomains. This explains and solves a problem posed by Nivat (1980). Basically, the construction gives a generalization of the powerdomain approach applicable to arbitrary nonflat (nondiscrete) algebraic domains.",

author = "Manfred Broy",

note = "Publisher Copyright: {\textcopyright} by Springer-Verlag Berlin Heidelberg 1984. All rights reserved.; 11th Symposium on Mathematical Foundations of Computer Science, MFCS 1984 ; Conference date: 03-09-1984 Through 07-09-1984",

year = "1984",

doi = "10.1007/BFb0030301",

language = "English",

isbn = "9783540133728",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "214--222",

editor = "Chytil, {Michael P.} and Vaclav Koubek",

booktitle = "Mathematical Foundations of Computer Science 1984 - Proceedings, 11th Symposium",

}