Abstract
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.
Get full access to this article
View all access options for this article.