Abstract
We deal with a relational model for the demonic semantics of programs. In particular, we prove some relevant results about fixed points of functions that involve demonic operators. We give explicitly the expression of the greatest fixed point wrt to the demonic ordering (demonic inclusion) of the semantic function assigned to nondeterministic while loops in previous papers. We show that this greatest fixed coincides with the least fixed point wrt to the usual ordering (angelic inclusion) of the same function.