Skip to main content
SpringerLink
Log in

Programmological aspects of the fixed point method

  • Published:
Cybernetics and Systems Analysis Aims and scope

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

References

  1. L. A. Kaluzhnin, “Algorithmization of mathematical problems”, Probl. Kibern., Fizmatgiz, Moscow, No. 2, 51–67 (1959).

    MATH  Google Scholar 

  2. G. Birkhoff, Lattice Theory [Russian translation], Nauka, Moscow (1984).

    Google Scholar 

  3. A. Tarski, “A lattice-theoretical fixpoint theorem and its applications”, Pac. J. Math.,5, No. 2, 285–309 (1955).

    MATH  MathSciNet  Google Scholar 

  4. S. Abian and A. B. Brown, “A theorem on partially ordered sets, with application to fixed point theorems”, Can. J. Math.,13, No. 1, 78–82 (1961).

    MathSciNet  Google Scholar 

  5. C. Kuratowski and A. Mostowski, Set Theory [Russian translation], Mir, Moscow (1970).

    Google Scholar 

  6. N. Bourbaki, Set Theory [Russian translation], Mir, Moscow (1965).

    Google Scholar 

  7. A. S. Kekris and J. N. Moskovakis, “Recursion in higher types”, in: Handbook of Mathematical Logic, Vol. III [Russian translation], Nauka, Moscow (1982), pp. 166–223.

    Google Scholar 

  8. P. Acel, “An introduction to theory of inductive definitions”, in: Handbook of Mathematical Logic, Vol. III [Russian translation], Nauka, Moscow (1982), pp. 224–268.

    Google Scholar 

  9. P. Hitchcock and D. Park, “Induction rules and proofs of termination”, in: Nivat. (ed.), Automata, Languages and Programming, Amsterdam (1972).

  10. D. Scott, “An outline of mathematical theory of computation”, Kibern. Sb., new series, Mir, Moscow, No. 14. 107–121 (1977).

    Google Scholar 

  11. D. Scott, “Lattice theory, data types, and semantics”, in: Data in Programming Languages. Abstraction and Typology [Russian translations], Mir, Moscow (1982), pp 25–53.

    Google Scholar 

  12. D. Scott, “Domains in denotational semantics”, in: Mathematical Logic in Programming [Russian translations], Mir, Moscow (1991), pp. 58–118.

    Google Scholar 

  13. H. Barendregt, The Lambda Calculus: Its Syntax and Semantics [Russian translation]. Mir, Moscow (1985).

    Google Scholar 

  14. H. Rogers, Theory of Recursive Functions and Effective Computability [Russian translation], Mir, Moscow (1972).

    Google Scholar 

  15. N. Cutland, Computability. An Introduction to Recursive Function Theory [Russian translation], Mir, Moscow (1983).

    Google Scholar 

  16. Z. Manna, “Fixpoint theory of programs”, Kibern. Sb., new series, Mir, Moscow, No. 15, 38–100 (1978).

    Google Scholar 

  17. J.-L. Lassez, V. L. Nguyen, and E. A. Sonenberg, “Fixed point theorems and semantics: a folk tale”, Inf. Proc. Lett.,14, No. 3, 112–116 (1982).

    MathSciNet  Google Scholar 

  18. L. A. Skornyakov, Elements of the Theory of Structures [in Russian], Nauka, Moscow (1982).

    Google Scholar 

  19. Yu. V. Kapitonova and A. A. Letichevskii, Mathematical Theory of Computer System Design [in Russian], Nauka, Moscow (1988).

    Google Scholar 

  20. L. A. Lyusternik and V. I. Sobolev, A Short Course of Functional Analysis [in Russian], Vysshaya Shkola, Moscow (1982).

    Google Scholar 

  21. A. N. Kolmogorov and S. V. Fomin, Elements of the Theory of Functions and Functional Analysis [in Russian], Nauka, Moscow (1976).

    Google Scholar 

  22. L. V. Kantorovich and G. P. Akilov, Functional Analysis [in Russian], Nauka, Moscow (1984).

    Google Scholar 

  23. R. Engelking, General Topology [Russian translation], Mir, Moscow (1986).

    Google Scholar 

  24. A. C. Davis, “A characterization of complete lattices”, Pac. J. Math.,5, No. 2, 311–319 (1955).

    MATH  Google Scholar 

Download references

Authors
  1. D. B. Bui
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. N. Red'ko
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 5, pp. 158–167, September–October, 1994.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bui, D.B., Red'ko, V.N. Programmological aspects of the fixed point method. Cybern Syst Anal 30, 768–774 (1994). https://doi.org/10.1007/BF02367760

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation