Skip to main content
Log in

On the existence of optimal fixpoints

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

Abstract

The concept of optimal fixpoint was introduced by Manna and Shamir [6, 7] in order to extract the maximum amount of “useful” information from a recursive definition. In this paper, we extend the concept of optimal fixpoint to arbitrary posets and investigate conditions which guarantee their existence. We prove that if a poset is chain-complete and has bounded joins, then every monotonic function has an optimal fixpoint. We also provide a sort of converse which generalizes a Theorem of A. Davis [2]. If a lower semilattice has bounded joins and every monotonic function has a fixpoint, then it is chain-complete.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. P. Crawley and R. Dilworth,Algebraic Theory of Lattices, Prentice Hall, Englewood Cliffs, New Jersey, 1973.

    Google Scholar 

  2. A. C. Davis, A characterization of complete lattices,Pacific Journal of Mathematics 5, 1955, pp. 311–319.

    Google Scholar 

  3. P. Hitchcock and D. Park, Induction rules and termination proofs, inAutomata, Languages and Programming, First International Colloquium, M. Nivat, ed., North-Holland, Amsterdam, July 1972, pp. 225–251.

    Google Scholar 

  4. K. Kuratowski and A. Mostowski,Set Theory, Studies in Logic, Vol. 86, North-Holland, Amsterdam, 1976.

    Google Scholar 

  5. Z. Manna,Mathematical Theory of Computation, McGraw-Hill, New York, 1974.

    Google Scholar 

  6. Z. Manna and A. Shamir, The theoretical aspects of the optimal fixedpoint,SIAM. J. Comput. 5(3), 1976, pp. 414–426.

    Google Scholar 

  7. Z. Manna and A. Shamir, The convergence of functions to fixedpoints of recursive definitions,Theoretical Computer Science 6, 1978, pp. 109–141.

    Google Scholar 

  8. G. Markowski, Chain-complete posets and directed sets with applications,Algebra Universalis 6(1), 1976, pp. 53–68.

    Google Scholar 

  9. A. Shamir, The fixedpoints of recursive definitions, Ph.D. Thesis, Applied Mathematics Dept., The Weizmann Institute, Rehovot, Israel, October 1976.

  10. A. Tarski, A lattice-theoretical fixpoint theorem and its applications,Pacific J. Math. 5, 1955, pp. 285–309.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gallier, J.H. On the existence of optimal fixpoints. Math. Systems Theory 13, 209–217 (1979). https://doi.org/10.1007/BF01744296

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01744296

Key words

Navigation