Skip to main content
SpringerLink
Log in

Concept of multiset in cybernetics

  • Brief Communications
  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

Some fundamental mathematical concepts used in cybernetics are examined. The relationship between these concepts is explained.

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. Yu. G. Gostev, “Data structures as sets with repeating elements,” Kibernetika, No. 4, 82–88 (1990).

    Google Scholar 

  2. G. Cantor, Studies in Set Theory [Russian translation], Nauka, Moscow (1985).

    Google Scholar 

  3. A. A. Fraenkel and Y. Bar-Hillel, Foundations of Set Theory [Russian translation], Mir, Moscow (1966).

    Google Scholar 

  4. D. E. Knuth, The Art of Computer Programming [Russian translation], Vol. 2, Mir, Moscow (1977).

    Google Scholar 

  5. A. Kircher, Musurgia universalis, Vols. 1, 2, Corbelleti, Rome (1650).

    Google Scholar 

  6. J. Prestet, Elementes de mathematique, Paris (1665).

  7. J. Wallis, A Treatise of Algebra, Flayford, Oxford (1685).

    Google Scholar 

  8. M. Aigner, Combinatorial Theory, Springer, New York (1979).

    Google Scholar 

  9. R. Stanley, Enumerative Combinatorics [Russian translation], Mir, Moscow (1990).

    Google Scholar 

  10. D. L. Childs, “Description of a set-theoretic data structure,” Proc. AFIPS Fall Joint Comput. Conf., North-Holland, New York (1968).

    Google Scholar 

  11. T. Hailperin, “Boole's Logic and Probability, North-Holland, New York (1976).

    Google Scholar 

  12. T. Hailperin, “Boole's algebra is not Boolean algebra,” Math. Mag.,54, No. 2, 173–184 (1981).

    Google Scholar 

  13. J. L. Peterson, Petri Net Theory and the Modeling of Systems, Prentice Hall, Englewood Cliffs, NJ (1981).

    Google Scholar 

  14. V. V. Solodovnikov and V. I. Tumarkin, “Flexible multisets and redundant control systems,” Dokl. Akad. Nauk SSSR,304, No. 4, 815–817 (1989).

    Google Scholar 

  15. M. S. Burgin, “Theory of named sets as a foundational basis for mathematics,” in; Structures in Mathematical Theories, Univ. del Pais Vasco, San Sebastian (1990), pp. 417–420.

    Google Scholar 

  16. R. Goldblatt, Topoi: The Categorical Analysis of Logic, North-Holland, Amsterdam (1979).

    Google Scholar 

  17. V. N. Red'ko, “Foundations of composition programming,” Programmirovanie, No. 3, 43–50 (1973).

    Google Scholar 

  18. M. S. Burgin, “Operations on named sets,” in: Ordered Sets and Lattices [in Russian], SGU, Saratov (1986), pp. 3–12.

    Google Scholar 

  19. G. P. Monro, “The concept of multiset,” Zeitschr. fur math. Logic und Grundlagen der Mathem.,33, No. 1, 171–178 (1987).

    Google Scholar 

Download references

Authors
  1. M. S. Burgin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 165–167, May–June, 1992.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Burgin, M.S. Concept of multiset in cybernetics. Cybern Syst Anal 28, 469–471 (1992). https://doi.org/10.1007/BF01125427

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation