On the existence of optimal fixpoints-Reference-Cited by-同舟云学术

On the existence of optimal fixpoints

Published:1979-12 Issue:1 Volume:13 Page:209-217
ISSN:0025-5661
Container-title:Mathematical Systems Theory
language:en
Short-container-title:Math. Systems Theory

Author:

Gallier Jean H.

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF01744296.pdf

Reference10 articles.

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

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

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.

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

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

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Generalizations of Tarski's fixed point theorem for order varieties of complete meet semilattices;Order;1989

2. Clausal intuitionistic logic I. fixed-point semantics;The Journal of Logic Programming;1988-03

3. Merging regular processes by means of fixed-point theory;Theoretical Computer Science;1986

4. Partial models and logic programming;Theoretical Computer Science;1986

5. Fixed point theorems and semantics: a folk tale;Information Processing Letters;1982-05