## 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.

Original language | English |
---|---|

Pages (from-to) | 1-19 |

Number of pages | 19 |

Journal | Theoretical Computer Science |

Volume | 36 |

Issue number | C |

DOIs | |

State | Published - 1985 |

Externally published | Yes |