Skip to main content
SpringerLink
Log in

Hierarchies of program logics

  • Published:
Siberian Mathematical Journal Aims and scope Submit manuscript

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

Literature Cited

  1. J. Barwise, Admissible Sets and Structures. An Approach to Definability Theory, Springer-Verlag, Berlin-New York (1975).

    Google Scholar 

  2. S. S. Maganov, “On fragments of finite rank,” in: Matematika: Abstracts of the Reports of the Seventh Kazakh Intercollege Scientific Conference on Mathematics and Mechanics [in Russian], Karaganda Univ. (1981), p. 136.

  3. V. Ya. Pelyaev and M. A. Taitslin, “On elementary properties of existentially closed systems,” Usp. Mat. Nauk,34, No. 2, 39–94 (1979).

    Google Scholar 

  4. D. Harel, Logics of Programs: Axiomatics and Descriptive Power, MIT. Lab. Comput. Sci. Tech. Report, No. 200, 1978.

  5. D. Harel, First-Order Dynamic Logic, Springer-Verlag, Berlin-New York (1979).

    Google Scholar 

  6. E. A. Boyarskaya, N. N. Repin, and M. A. Taitslin, “A determinate dynamic logic that is weaker than the dynamic logic,” in: Questions of the Theory of Algebraic Systems [in Russian], Karaganda Univ. (1981), pp. 20–31.

  7. M. M. Erimbetov, “On the expressive power of program logics,” in: Investigations in Theoretical Programming [in Russian], Kazakhsk. Univ., Alma-Ata (1981), pp. 49–68.

    Google Scholar 

Download references

Authors
  1. M. A. Taitslin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

S. M. Kirov Kazakh State University, Alma-Ata. Translated from Sibirskii Matematicheskii Zhurnal, Vol. 24, No. 3, pp. 184–192, May–June, 1983.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Taitslin, M.A. Hierarchies of program logics. Sib Math J 24, 469–476 (1983). https://doi.org/10.1007/BF00971560

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation