We deal with a relational model for the demonic semantics of programs. The demonic semantics of a while loop is given as a fixed point of a function involving the demonic operators. This motivates us to investigate the fixed points of these functions. We give the expression of the greatest fixed point with respect to the demonic ordering (demonic inclusion) of the semantic function. We prove th...

A universal schema for diagonalization was popularized by N. S. Yanofsky (2003) in which the existence of a (diagonolized-out and contradictory) object implies the existence of a fixed-point for a certain function. It was shown that many self-referential paradoxes and diagonally proved theorems can fit in that schema. Here, we fit more theorems in the universal schema of diagonalization, such a...

We propose a method to characterize the fixed points described in Tarski’s theorem for complete lattices. The method is deductive: the least and greatest fixed points are ”proved” in some inference system defined from deduction rules. We also apply the method to two other fixed point theorems, a generalization of Tarski’s theorem to chain-complete posets and Bourbaki-Witt’s theorem. Finally, we...

Some fixed point theorems based on an asymptotic regularity condition have been obtained, which generalize the previously well-known results. 2000 Mathematics Subject Classification: 47H10, 54H25.