ω-Rule and Continuity on Connections Between Algebraic Semantics, Fixpoint Semantics and Algorithmic Logic
Patrice Enjalbert · Fundamenta Informaticae · 1984
Some links between algorithmic logic (AL) and algebraic semantics are examined. We show that the axioms of AL force the functions associated with programs to be fixpoints of the usual functionals, the ω-rule being indispensable for forcing the least one.