z-logo
open-access-imgOpen Access
How Iterative are Iterative Algebras?
Author(s) -
Jiřı́ Adámek,
Stefan Milius,
Jiřı́ Velebil
Publication year - 2006
Publication title -
electronic notes in theoretical computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.242
H-Index - 60
ISSN - 1571-0661
DOI - 10.1016/j.entcs.2006.06.010
Subject(s) - property (philosophy) , iterative method , mathematics , algebra over a field , computer science , pure mathematics , mathematical optimization , philosophy , epistemology
Iterative algebras are defined by the property that every guarded system of recursive equations has a unique solution. We prove that they have a much stronger property: every system of recursive equations has a unique strict solution. And we characterize those systems that have a unique solution in every iterative algebra

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom