Higher-Order and Symbolic Computation

, Volume 18, Issue 1, pp 51–77

Least Reflexive Points of Relations

Authors

    • Département d’InformatiqueUniversité Laval
  • Bernhard Möller
    • Institut für InformatikUniversität Augsburg
Article

DOI: 10.1007/s10990-005-7006-5

Cite this article as:
Desharnais, J. & Möller, B. Higher-Order Symb Comput (2005) 18: 51. doi:10.1007/s10990-005-7006-5

Abstract

Assume a partially ordered set (S, ≤) and a relation R on S. We consider various sets of conditions in order to determine whether they ensure the existence of a least reflexive point, that is, a least x such that xRx. This is a generalization of the problem of determining the least fixed point of a function and the conditions under which it exists. To motivate the investigation we first present a theorem by Cai and Paige giving conditions under which iterating R from the bottom element necessarily leads to a minimal reflexive point; the proof is by a concise relation-algebraic calculation. Then, we assume a complete lattice and exhibit sufficient conditions, depending on whether R is partial or not, for the existence of a least reflexive point. Further results concern the structure of the set of all reflexive points; among other results we give a sufficient condition that these form a complete lattice, thus generalizing Tarski’s classical result to the nondeterministic case.

Keywords

least reflexive pointgreatest reflexive pointfixed pointlatticepartial orderrelationinflationary relation
Download to read the full article text

Copyright information

© Springer Science + Business Media, Inc. 2005